Perfect Number Classifier
Test whether an integer is a perfect number and see its proper divisors using browser-only math.
Check whether a number is perfect
A perfect number is a positive integer equal to the sum of its proper divisors (all positive divisors except itself). The smallest examples are 6 (1+2+3), 28 (1+2+4+7+14), and 496. Euclid and Euler described infinite families tied to Mersenne primes; this tool checks individual values by listing proper divisors in your browser.
How to use it
- Type a positive integer up to one billion.
- Read whether the number is perfect and the sum of its proper divisors.
- Copy the divisor list for homework or number-theory notes.
To generate perfect numbers from Mersenne exponents, see Generate Perfect Numbers.
Frequently Asked Questions
Is 1 a perfect number?
No. Its only proper divisor is 1, and the sum does not equal 1 in the usual definition.
Why is there an input limit?
Listing all divisors requires work proportional to √n; very large inputs could freeze the tab.
Does this prove infinitude of perfect numbers?
No. It only classifies the single integer you enter.