Perfect: 28
1 + 2 + 4 + 7 + 14 = 28
The proper-divisor sum equals the number.
Commas, spaces, or underscores may group digits in threes. Zero, negative numbers, and decimals are outside this checker’s positive-integer definition.
Try 28: its proper divisors are 1, 2, 4, 7, and 14, which sum to 28, so it is perfect.
Let s(n) be the sum of the positive divisors of n other than n itself. These are its proper positive divisors. Comparing s(n) with n gives exactly one classification:
Perfect: s(n) = n
Abundant: s(n) > n
Deficient: s(n) < n
The proper-divisor sum is also called the aliquot sum. Because the full divisor sum σ(n) includes n, the calculator uses s(n) = σ(n) − n.
1 + 2 + 4 + 7 + 14 = 28
The proper-divisor sum equals the number.
1 + 2 + 3 + 4 + 6 = 16
The sum exceeds 12 by 4.
1 + 2 + 4 + 8 = 15
The sum falls short of 16 by 1.
Exactness and limits: calculations use exact BigInt arithmetic. Inputs are limited to 1 trillion, and factorization runs in a background worker with a five-second limit so unusually difficult inputs do not leave the page unresponsive.
A perfect number equals the sum of its proper positive divisors. For example, 28 is perfect because 1 + 2 + 4 + 7 + 14 = 28.
An abundant number has a proper-divisor sum greater than itself. For example, the proper divisors of 12 sum to 16.
A deficient number has a proper-divisor sum less than itself. Every prime is deficient because its only proper positive divisor is 1.
One is deficient. It has no proper positive divisors, so its proper-divisor sum is 0.
Every perfect number currently known is even. Whether an odd perfect number exists remains an open problem.
The signed difference s(n) − n measures how far the proper-divisor sum is above or below the number. A positive difference is abundance, a negative difference is deficiency, and zero indicates a perfect number.
Yes. Factorization and classification happen entirely in your browser. The checker does not upload, store, or add the number to the page URL.