Perfect Number Checker screenshot

Perfect Number Checker

Test whether a whole number is perfect, abundant or deficient by summing its proper divisors exactly, up to one trillion.

Privacy First
0 Runs
Updated 2026-11-22
No upload
Instant
No signup

Perfect Number Checker

Test whether a whole number is perfect, abundant or deficient by summing its proper divisors exactly, up to one trillion.

How this page computes

The divisors come from the prime factorisation, which is why 33,550,336 answers as quickly as 28. The one-trillion ceiling is a limit of the trial-division factoriser, stated rather than hidden.

The calculation runs entirely in this browser tab; nothing is uploaded.

The page sums every proper divisor of a whole number and compares the total with the number itself: equal is perfect, larger is abundant, smaller is deficient. The sum is built from the prime factorisation, so 28 is reported as perfect without testing every smaller number.

Worked example: 28 gives a sum of 28 and the proper divisors 1, 2, 4, 7 and 14. Inputs below 2 and values above one trillion are refused, because trial division past that ceiling stops being instant.

How to use the Perfect Number Checker

Enter one whole number and press Run. The first line names the number as perfect, abundant or deficient, and the second gives the sum of its proper divisors.

The third line lists the proper divisors, up to twelve of them, so the classification can be checked by hand. A longer list ends with the count of the divisors it did not print.

The rule this page applies

A proper divisor is a positive divisor smaller than the number. Perfect means the proper divisors sum to the number, abundant means the sum is larger, and deficient means it is smaller.

The divisors come from the prime factorisation, which is why 33,550,336 answers as quickly as 28. The one-trillion ceiling is a limit of the trial-division factoriser, stated rather than hidden.

What to Expect

Best for

  • Classifying a number theory exercise
  • Checking a claim that a number is perfect
  • Finding the aliquot sum of a number

Not ideal for

  • Proving a number perfect for arbitrarily large inputs
  • Counting divisors beyond the stated ceiling
  • Decimal or negative numbers

What this tool keeps

  • The number and its exact proper-divisor sum

What may need cleanup

  • Nothing: the classification and the sum are final

Common errors

  • A value below 2 is refused, because a perfect number is greater than 1
  • A value above one trillion is refused with the ceiling named

Example use cases

  • Check the first perfect numbers: 6, 28, 496 and 8128
  • Find an abundant number such as 12

Sample input

28

Sample output

28 is perfect sum of proper divisors = 28 proper divisors: 1, 2, 4, 7, 14

Who this is for

  • Students learning divisor sums
  • Readers checking a number theory claim

Frequently asked questions

Is 1 a perfect number?

No. 1 has no proper divisor at all, so its proper-divisor sum is zero, and the page refuses anything below 2 rather than answering a question about a different definition.

How many divisors are printed?

Up to twelve, which covers every small number a reader is likely to check by hand. A longer list ends with the number of divisors that were not printed, so nothing is silently dropped.

Why is there a one-trillion ceiling?

The page finds divisors by trial division up to the square root. At one trillion that is a million steps, still instant; beyond it the wait would grow without bound, so the page names the limit instead.

Is anything uploaded?

Nothing is uploaded. The numbers are read and the arithmetic runs in this browser tab with JavaScript, and reloading the page discards both the input and the result.

Developer program

Build custom tools for your store

Join the SDK program to create useful ecommerce utilities for your store.