Perfect and Amicable Numbers: Special Numbers Explained

A perfect number is a positive integer that equals the sum of its proper divisors — all divisors except itself. The smallest is 6 = 1 + 2 + 3, and the next is 28 = 1 + 2 + 4 + 7 + 14. Amicable numbers are a friendly pair: two different numbers such that each equals the sum of the other's proper divisors. The smallest amicable pair is (220, 284), because the proper divisors of 220 add up to 284 and those of 284 add up to 220.

These numbers matter because they were the first deep discoveries about divisor structure, studied by the Pythagoreans over 2,500 years ago. The Euclid–Euler theorem completely describes all even perfect numbers through Mersenne primes, and the search for odd perfect numbers is one of the oldest open problems in mathematics. Amicable pairs keep appearing in computational searches, with over a billion pairs now known.

Key Concepts

• Proper divisors: all positive divisors of n except n itself.
• Aliquot sum s(n): the sum of the proper divisors of n; equivalently s(n) = σ(n) − n.
• Perfect number: n is perfect when s(n) = n, i.e. σ(n) = 2n.
• Deficient and abundant: s(n) < n means deficient; s(n) > n means abundant; 12 is abundant since 1 + 2 + 3 + 4 + 6 = 16.
• Amicable pair: distinct m, n with s(m) = n and s(n) = m, i.e. σ(m) = σ(n) = m + n.
• Mersenne prime: a prime of the form 2^p − 1; every even perfect number comes from one.

Formulas

• Euclid–Euler theorem: an even number n is perfect ⟺ n = 2^p−1(2^p − 1) where 2^p − 1 is prime.
• Perfect test via σ: n is perfect ⟺ σ(n) = 2n, using the multiplicative formula for σ.
• Amicable test: (m, n) is amicable ⟺ σ(m) = σ(n) = m + n with m ≠ n.
• Generating even perfect numbers: p = 2 gives 2·3 = 6; p = 3 gives 4·7 = 28; p = 5 gives 16·31 = 496; p = 7 gives 64·127 = 8128.
• Odd perfect numbers: none is known; if one exists it must exceed 10^1500 and have at least 101 prime factors (established computational bounds).

Worked Example

Verify that 28 is perfect and that (220, 284) is amicable. Part A — 28: its proper divisors are 1, 2, 4, 7, 14. Their sum is 1 + 2 + 4 + 7 + 14 = 28 ✓, so 28 is perfect. It also fits the Euclid–Euler form: p = 3 gives 2^2·(2^3 − 1) = 4·7 = 28, and 7 is prime ✓. Part B — the amicable pair: the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110. Their sum: 1 + 2 = 3; 3 + 4 = 7; 7 + 5 = 12; 12 + 10 = 22; 22 + 11 = 33; 33 + 20 = 53; 53 + 22 = 75; 75 + 44 = 119; 119 + 55 = 174; 174 + 110 = 284 ✓. The proper divisors of 284 are 1, 2, 4, 71, 142, and 1 + 2 + 4 + 71 + 142 = 220 ✓. So s(220) = 284 and s(284) = 220 — the pair is amicable.

Common Misconceptions

• "Perfect numbers are rare because only a few exist." Infinitely many even perfect numbers would follow from infinitely many Mersenne primes — which is unknown. What is known: every even perfect number ends in 6 or 8, and all of them fit the Euclid–Euler formula.
• "Amicable means the two numbers are consecutive or close." No relation is required between the sizes. The smallest pair (220, 284) happens to be close, but pairs like (1184, 1210) and far larger ones are scattered irregularly.
• "If σ(n) = 2n then n is perfect — and that's the only test." The σ test is correct, but the Euclid–Euler theorem is far more powerful: it generates every even perfect number directly from Mersenne primes, no divisor listing needed.

Real-World Applications

• Primality records: the search for perfect numbers drives the search for Mersenne primes; the largest known primes are all Mersenne primes found by distributed computing.
• Divisor-function theory: perfect and amicable numbers are the classic test cases for σ(n) formulas and multiplicativity.
• Algorithm benchmarking: factorisation and divisor-sum algorithms are stress-tested on the hunt for new amicable pairs.
• Recreational mathematics: sociable chains (longer cycles of the aliquot function) generalise amicable pairs and inspire computational number-theory projects.

Perfect numbers are exactly the even numbers 2^p−1(2^p − 1) built from Mersenne primes, and amicable pairs are mutual aliquot-sum partners like (220, 284). The Euclid–Euler theorem turns perfect-number hunting into prime hunting, while the σ(n) = 2n test and the σ(m) = σ(n) = m + n test make verification mechanical. Whether an odd perfect number exists remains one of mathematics' oldest unsolved mysteries.