Perfect Number Checker
Check if n is a perfect number; list its divisors.
Perfect numbers: definition and Euclid-Euler theorem
A perfect number is a positive integer n equal to the sum of its proper divisors (divisors excluding n itself). Formally, σ(n) − n = n, where σ is the sum-of-divisors function. The smallest examples: 6 = 1 + 2 + 3; 28 = 1 + 2 + 4 + 7 + 14; then 496, 8128. Euclid (Elements, Book IX) proved that if 2^p − 1 is a Mersenne prime, then (2^p − 1) · 2^(p−1) is an even perfect number. Euler proved the converse: every even perfect number has this form. Only 51 even perfect numbers are known as of 2024 (each tied to a GIMPS Mersenne prime). The existence of odd perfect numbers remains an open problem — if any exist, they must exceed 10^3000.
Applications and historical context
Perfect numbers are primarily of theoretical interest in number theory. They underlie work by Erdős on aliquot sequences and are deeply linked to Mersenne primes, the largest primes humans have ever found. They appear in recreational mathematics, mathematical olympiad problems, and number-mysticism traditions (Pythagoreans considered 6 and 28 spiritually significant).
FAQ
Does any odd perfect number exist? Unknown — one of the oldest open problems in mathematics. Computer searches up to 10^3000 found none.
Are there infinitely many perfect numbers? Unknown; depends on whether infinitely many Mersenne primes exist (also conjectured but unproven).
What is the next perfect number after 8128? 33,550,336 (p = 13).
Why are they called "perfect"? Ancient Greek tradition — Pythagoreans saw the equality between a number and the sum of its parts as a sign of harmony.
Related Tools
Narcissistic / Armstrong Numbers Checker
Check whether a number is narcissistic/Armstrong (153 = 1³+5³+3³). Show the digit-power decomposition and list all narcissistic numbers in a range. Displays all 36 known base-10 narcissistic numbers from 0 to 4,679,307,774.
Prime Number Checker
Check if a number is prime. Shows the prime factorization, the previous prime and the next prime. Instant result.
PT Classical Poetry Verses
Shows verse count for classical Portuguese poetic forms sonnet ballad sextain.
Stacking Frames Tracking Photo
Estimates number of frames needed to stack for a desired SNR gain in astrophoto.
Book Chapter Count Calculator
Computes suggested chapter count for a book based on total words and average words per chapter of given genre.
Blast Hole Count
Calculate the number of holes of a blast pattern, N = area ÷ (burden × spacing), dividing the bench area to blast by the pattern area of each hole (burden B × spacing S). The result is the number of holes needed to cover the area with the specified drilling pattern. In practice, round up. It is an essential quantity calculation in blast planning: it sets the drilling time, the amount of explosive and accessories, and the operation cost. Wider patterns (larger B and S) reduce the number of holes but may worsen fragmentation. Enter the area, the burden and the spacing.
The results provided by this tool are for general informational and educational purposes only and do not constitute professional, financial, medical, legal, tax or accounting advice. Always confirm important decisions with a qualified professional and official sources.