Perfect Number Checker
Our free number theory calculator solves perfect number problems. Get worked examples, visual aids, and downloadable results.
Calculator
Adjust values & calculateProper Divisors of 28
Perfect Numbers up to 10,000
Formula
A number n is perfect when the sum of all its proper divisors (divisors less than n) equals n itself. The divisor function sigma(n) sums all divisors including n. For even perfect numbers: n = 2^(p-1) * (2^p - 1) where 2^p - 1 is a Mersenne prime.
Last reviewed: December 2025
Worked Examples
Example 1: Checking if 28 is a Perfect Number
Example 2: Classifying the Number 12
Background & Theory
The Perfect Number Checker applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Perfect Number Checker traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
Perfect: sigma(n) - n = n, i.e., sum of proper divisors = n
A number n is perfect when the sum of all its proper divisors (divisors less than n) equals n itself. The divisor function sigma(n) sums all divisors including n. For even perfect numbers: n = 2^(p-1) * (2^p - 1) where 2^p - 1 is a Mersenne prime.
Worked Examples
Example 1: Checking if 28 is a Perfect Number
Problem: Find all proper divisors of 28 and determine if their sum equals 28.
Solution: Proper divisors of 28: 1, 2, 4, 7, 14\nSum = 1 + 2 + 4 + 7 + 14 = 28\n28 = 28, so 28 IS a perfect number.\nMersenne connection: 28 = 2^2 * (2^3 - 1) = 4 * 7\nMersenne prime: 7 = 2^3 - 1 with exponent p = 3
Result: 28 is PERFECT | sigma(28) = 56 | Abundancy index = 2.0000
Example 2: Classifying the Number 12
Problem: Determine whether 12 is deficient, perfect, or abundant.
Solution: Proper divisors of 12: 1, 2, 3, 4, 6\nSum = 1 + 2 + 3 + 4 + 6 = 16\n16 > 12, so 12 is ABUNDANT.\nAbundance = 16 - 12 = 4\nAbundancy index = sigma(12)/12 = 28/12 = 2.333
Result: 12 is ABUNDANT | Sum of divisors: 16 | Abundance: +4
Frequently Asked Questions
What is a perfect number and how is it defined?
A perfect number is a positive integer that equals the sum of its proper divisors, which are all divisors excluding the number itself. The first four perfect numbers are 6 (1+2+3), 28 (1+2+4+7+14), 496, and 8128. These numbers have fascinated mathematicians since antiquity. Euclid proved around 300 BCE that if 2^p - 1 is prime (a Mersenne prime), then 2^(p-1) * (2^p - 1) is a perfect number. Euler later proved that all even perfect numbers have this form. Whether any odd perfect numbers exist remains one of the oldest unsolved problems in mathematics, with no examples found despite extensive computer searches up to 10^2200.
How are perfect numbers connected to Mersenne primes?
The Euclid-Euler theorem establishes a beautiful one-to-one correspondence between even perfect numbers and Mersenne primes. Euclid showed that whenever 2^p - 1 is prime, the number 2^(p-1) * (2^p - 1) is perfect. Two thousand years later, Euler proved the converse: every even perfect number has exactly this form. So 6 = 2^1 * 3 corresponds to the Mersenne prime 3 = 2^2 - 1, and 28 = 2^2 * 7 corresponds to the Mersenne prime 7 = 2^3 - 1. Since there are currently 51 known Mersenne primes, there are exactly 51 known even perfect numbers. Finding a new Mersenne prime automatically yields a new perfect number.
Do odd perfect numbers exist?
The existence of odd perfect numbers is one of the most famous unsolved problems in number theory, open for over 2,000 years. No odd perfect number has ever been found, and most mathematicians believe none exist. However, a proof of their nonexistence has eluded researchers. If one exists, it must satisfy stringent conditions: it must be greater than 10^2200, have at least 101 prime factors (counting multiplicity), have a special prime factor of the form p^a where p is congruent to 1 modulo 4, and cannot be divisible by 105. Despite these constraints, a complete proof remains elusive. The problem illustrates how seemingly simple definitions can lead to extraordinarily difficult mathematical questions.
What are multiply perfect numbers?
A multiply perfect number (or multiperfect number) is a positive integer n whose divisor sum sigma(n) is a multiple of n. Ordinary perfect numbers are 2-perfect since sigma(n) = 2n. The smallest 3-perfect number is 120, with sigma(120) = 360 = 3 * 120. The smallest 4-perfect number is 30,240, and the smallest 5-perfect number is 14,182,439,040. As the multiplicity k increases, the numbers become extraordinarily large and sparse. There are only about 6 known 11-perfect numbers. Finding and studying multiply perfect numbers requires sophisticated factoring algorithms and extensive computation. They connect to questions about the structure of the divisor function in analytic number theory.
What are amicable numbers and how do they relate to perfect numbers?
Amicable numbers are pairs of distinct numbers where each is the sum of the proper divisors of the other. The smallest amicable pair is 220 and 284: the proper divisors of 220 sum to 284, and the proper divisors of 284 sum to 220. A perfect number can be thought of as amicable with itself. Amicable numbers were known to the Pythagoreans, and Thabit ibn Qurra discovered a formula for generating some pairs in the 9th century. Euler found over 60 amicable pairs. As of recent counts, billions of amicable pairs are known. Sociable numbers extend this concept to chains of length greater than 2, where the divisor-sum function cycles through several numbers before returning to the start.
What properties do the digits of perfect numbers have?
Even perfect numbers exhibit fascinating digital properties. Every even perfect number greater than 6 ends in 6 or 8 when written in base 10, alternating in a regular pattern. Specifically, if the Mersenne exponent p is congruent to 3 mod 4, the perfect number ends in 8; if p is congruent to 1 mod 4, it ends in 6. Additionally, every even perfect number except 6 is the sum of consecutive odd cubes: 28 = 1^3 + 3^3, 496 = 1^3 + 3^3 + 5^3 + 7^3, and so on. The digital root of every even perfect number (except 6) is 1, meaning if you repeatedly sum the digits, you always reach 1. These patterns emerge from the algebraic structure of the Euclid-Euler formula.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy