Skip to main content

Perfect Number Checker

Mathematics - Perfect Numbers

Perfect Number Checker

Check if a number is perfect, abundant, or deficient with step-by-step explanation. Learn about proper divisors, Mersenne primes, and the Euclid-Euler theorem that characterizes all even perfect numbers.

Table of Contents

  1. 1What Is a Perfect Number?
  2. 2Abundant and Deficient Numbers
  3. 3How to Check for Perfect Numbers
  4. 4Step-by-Step Examples
  5. 5More Classification Examples
  6. 6The Euclid-Euler Theorem
  7. 7Mersenne Primes Connection
  8. 8Known Perfect Numbers
  9. 9Common Mistakes to Avoid
  10. 10Historical Significance
  11. 11Practice Problems with Solutions
  12. 12Tips for Mastering Number Classification
  13. 13Final Thoughts

Check Perfect, Abundant, or Deficient

Enter a positive integer to check if it's perfect, abundant, or deficient. Click Check for step-by-step working showing proper divisors and their sum.

Result will appear here.
Note: A perfect number is a positive integer that equals the sum of its proper divisors (all positive divisors except the number itself). The first perfect number is 6 (1 + 2 + 3 = 6), followed by 28, 496, and 8128.

Perfect Numbers – Complete Explanation

A perfect number is a positive integer that equals the sum of its proper divisors — all positive divisors except the number itself. These rare and beautiful numbers have fascinated mathematicians since ancient Greece. Only 51 perfect numbers are known today, and it's still unknown whether any odd perfect numbers exist.

Perfect Number Definition

A number n is perfect if: sum of all proper divisors of n = n

Equivalently: ฯƒ(n) = 2n, where ฯƒ(n) is the sum of all divisors.

The first perfect number is 6: proper divisors 1, 2, 3 → 1 + 2 + 3 = 6.

1. What Is a Perfect Number?

A perfect number answers the question: "Can this number be perfectly decomposed into the sum of its proper parts?" This concept was studied by Euclid around 300 BCE and later by Euler, who characterized all even perfect numbers.

Key facts:

  • Known perfect numbers: Only 51 have been discovered (all even).
  • Odd perfect numbers: None have been found — it's an open problem in mathematics whether any exist.
  • Even perfect numbers: All follow the Euclid-Euler formula: 2แต–⁻¹(2แต– - 1) where 2แต– - 1 is a Mersenne prime.
  • Perfect numbers grow rapidly: 6, 28, 496, 8128, 33,550,336, ...

2. Abundant and Deficient Numbers

Numbers are classified into three categories based on the sum of their proper divisors:

Perfect Number: Sum of proper divisors = the number.

Example: 6 → 1 + 2 + 3 = 6 ✓

Abundant Number: Sum of proper divisors > the number.

Example: 12 → 1 + 2 + 3 + 4 + 6 = 16 > 12

The first abundant number is 12. All multiples of abundant numbers are also abundant.

Deficient Number: Sum of proper divisors < the number.

Example: 10 → 1 + 2 + 5 = 8 < 10

Most numbers are deficient. All prime numbers are deficient (only proper divisor is 1).

3. How to Check for Perfect Numbers

The systematic method:

  1. Find all proper divisors of the number (divisors less than the number itself).
  2. Sum the proper divisors.
  3. Compare the sum to the number:
    • Sum = number → Perfect
    • Sum > number → Abundant
    • Sum < number → Deficient

4. Step-by-Step Examples

Example 1: Checking 28 (Perfect)

Check if 28 is a perfect number.

Step 1: Find all proper divisors of 28:
        1, 2, 4, 7, 14

Step 2: Sum the proper divisors:
        1 + 2 + 4 + 7 + 14 = 28

Step 3: Compare:
        Sum (28) = Number (28)

Result: 28 is a PERFECT NUMBER! ✨

Note: 28 = 2² × (2³ - 1), where 2³ - 1 = 7 is a Mersenne prime.

Example 2: Checking 12 (Abundant)

Check if 12 is perfect, abundant, or deficient.

Step 1: Proper divisors of 12:
        1, 2, 3, 4, 6

Step 2: Sum = 1 + 2 + 3 + 4 + 6 = 16

Step 3: 16 > 12

Result: 12 is ABUNDANT (excess of 4).

5. More Classification Examples

6: 1 + 2 + 3 = 6 → PERFECT

18: 1+2+3+6+9 = 21 > 18 → ABUNDANT

14: 1+2+7 = 10 < 14 → DEFICIENT

496: 1+2+4+8+16+31+62+124+248 = 496 → PERFECT

6. The Euclid-Euler Theorem

The most important theorem about perfect numbers was proved by Euclid (Elements, Book IX) and completed by Euler:

Euclid-Euler Theorem

An even number is perfect if and only if it has the form:
  2p-1(2p - 1)
where 2p - 1 is a Mersenne prime (and p is prime).

Generating perfect numbers:

p = 2: 2¹ × (2² - 1) = 2 × 3 = 6 (2² - 1 = 3 is prime ✓)

p = 3: 2² × (2³ - 1) = 4 × 7 = 28 (2³ - 1 = 7 is prime ✓)

p = 5: 2⁴ × (2⁵ - 1) = 16 × 31 = 496 (2⁵ - 1 = 31 is prime ✓)

p = 7: 2⁶ × (2⁷ - 1) = 64 × 127 = 8128 (2⁷ - 1 = 127 is prime ✓)

7. Mersenne Primes Connection

Mersenne primes are primes of the form 2แต– - 1 (where p is also prime). They are intimately connected to perfect numbers:

  • Every Mersenne prime generates exactly one even perfect number.
  • Every even perfect number corresponds to exactly one Mersenne prime.
  • The largest known perfect number (discovered 2018) has 49,724,095 digits.
Open Problem: It is unknown whether there are infinitely many perfect numbers, and whether any odd perfect numbers exist. Both questions have remained unsolved for centuries.

8. Known Perfect Numbers

The first eight perfect numbers:

1.  6
2.  28
3.  496
4.  8,128
5.  33,550,336
6.  8,589,869,056
7.  137,438,691,328
8.  2,305,843,008,139,952,128

9. Common Mistakes to Avoid

  • Including the number itself as a proper divisor: Proper divisors are strictly less than the number. For 6, proper divisors are 1, 2, 3 — not 1, 2, 3, 6.
  • Missing divisors: Use the square root method to find all divisors efficiently: check up to √n and collect both the divisor and its paired quotient.
  • Confusing perfect numbers with perfect squares: A perfect number is about the sum of divisors. A perfect square is a number that's the square of an integer (like 36 = 6²). They are different concepts.
  • Thinking all abundant numbers are large: The smallest abundant number is 12. Many small numbers are abundant.
  • Assuming abundant means "has many divisors": Abundant is strictly about the sum of proper divisors exceeding the number, not the count of divisors.

10. Historical Significance

  • Ancient Greece: The Pythagoreans studied perfect numbers around 500 BCE, attributing mystical properties to them.
  • Euclid's Elements (c. 300 BCE): Book IX contains the proof that 2แต–⁻¹(2แต– - 1) is perfect when 2แต– - 1 is prime.
  • Nicomachus (c. 100 CE): Classified numbers as perfect, abundant, and deficient in his work Introductio Arithmetica.
  • Leonhard Euler (1747): Proved that every even perfect number must be of Euclid's form — completing the characterization.
  • Modern era: The search for Mersenne primes (and thus perfect numbers) is a major distributed computing project (GIMPS).

11. Practice Problems with Solutions

Problem 1: Is 20 perfect, abundant, or deficient?

Solution: Proper divisors: 1,2,4,5,10 → sum = 22 > 20 → ABUNDANT

Problem 2: Verify that 496 is perfect.

Solution: 496 = 2⁴ × 31 | Sum = 1+2+4+8+16+31+62+124+248 = 496 ✓ PERFECT

Problem 3: Classify the prime number 17.

Solution: Only proper divisor is 1 → sum = 1 < 17 → DEFICIENT (all primes are deficient)

Problem 4: Using p = 13, find the corresponding even perfect number if 2¹³ - 1 = 8191 is prime.

Solution: 2¹² × 8191 = 4096 × 8191 = 33,550,336

12. Tips for Mastering Number Classification

  • Use the square root method to find all divisors efficiently — it's much faster than checking every number.
  • Remember that all prime numbers are deficient (sum of proper divisors = 1).
  • Multiples of perfect numbers are often abundant.
  • The abundancy index (sum of divisors / number) is useful: > 2 means abundant, = 2 means perfect, < 2 means deficient.
  • Perfect numbers are rare — don't expect to find them often without deliberately checking known candidates.

13. Final Thoughts

Perfect numbers represent one of the most elegant intersections of number theory — connecting prime numbers, powers of two, and the sum of divisors in a harmonious equation. From Euclid's ancient proof to modern distributed computing projects searching for the next Mersenne prime, perfect numbers continue to captivate mathematicians and computer scientists alike.

Understanding perfect, abundant, and deficient numbers gives you insight into the structure of integers and their divisors. Use this calculator to explore number classification, but practice finding divisors and their sums manually to build number sense and fluency.

Labels: