Check whether a positive integer equals the sum of its proper positive divisors. A checkable formula accompanies classification instead of leaving an unexplained number.
The proper divisors of 28 are 1,2,4,7,14. Their sum is 28, so the number is perfect.
A perfect number balances exactly with its positive divisors excluding itself. A smaller proper-divisor sum is deficient; a larger sum is abundant.
The calculation treats positive integer in the roles printed for Perfect Number, rather than as interchangeable entries in perfect number checker.
Compute the full positive-divisor sum, subtract n, and compare the result with n. A hand-worked extension of Perfect Number Checker is inspect proper divisors.
One is deficient, not perfect. This calculator tests positive integers and may take longer for unusually large inputs. If the Perfect Number Checker assumptions do not fit, consider sum every divisor.
Save extra digits internally if classification will become an input to another calculation.
Perfect numbers connect divisor sums with Mersenne primes and provide classic examples in elementary number theory.
A field name is part of the formula. Match the problem's quantities to positive integer, then check that they share the scale assumed by the perfect number checker relationship.
Small input changes usually destroy perfection because the property depends on the complete factor structure. This is a stronger check than judging the answer only by how many decimal places it shows.
Match the reported precision to positive integer, not to the number of digits the browser can display. Preserve an exact form when it communicates the perfect number checker structure more clearly than a decimal.
This checker classifies the proper-divisor sum; the divisor-sum calculator reports its numerical total. The formula panel makes the chosen definition explicit.
The minimum audit trail is short: positive integer, their units, and the formula beside the answer. It is enough to distinguish this calculation from a similar-looking shortcut.
Every known even perfect number has form 2^(p−1)(2^p−1) when 2^p−1 is prime. For p=3 this gives 4×7=28. The theorem explains why perfect numbers are rare, while the divisor-sum check remains the direct test for a supplied integer.
Yes, because 1+2+3=6.
No odd perfect number has been found or ruled out.
The full sum does; the perfect test removes it.