TFT

Perfect Number Checker - Is It a Perfect Number?

Check if any number is a perfect number with our free online perfect number checker. Instantly determine if the sum of proper divisors equals the number itself.

Examples:

Understanding Perfect Numbers

A perfect number is a positive integer that equals the sum of its proper divisors - all the positive whole numbers that divide it evenly, excluding the number itself. It's like the number is perfectly balanced: its parts add up exactly to the whole.

Take 6, the smallest perfect number. Its proper divisors are 1, 2, and 3. Add them up: 1 + 2 + 3 = 6. Perfect. The next one is 28: its divisors 1, 2, 4, 7, and 14 sum to exactly 28.

How to Check if a Number Is Perfect

Step 1: Find All Proper Divisors

List all positive integers that divide the number evenly, excluding the number itself. Start with 1 (always a divisor), then check 2, 3, 4, and so on up to the square root of the number.

Step 2: Add Them Up

Sum all the proper divisors you found. This is called the aliquot sum.

Step 3: Compare

If the sum equals the original number, it's perfect. If the sum is less, the number is deficient. If the sum is more, it's abundant.

Worked Examples

Example 1: Checking 6

Number: 6
Find divisors: 6 ÷ 1 = 6 ✓, 6 ÷ 2 = 3 ✓, 6 ÷ 3 = 2 ✓
Proper divisors (excluding 6): 1, 2, 3
Sum: 1 + 2 + 3 = 6
6 = 6, so 6 is a perfect number!

Example 2: Checking 28

Number: 28
Find divisors: 1, 2, 4, 7, 14 (all divide 28 evenly)
Proper divisors: 1, 2, 4, 7, 14
Sum: 1 + 2 + 4 + 7 + 14 = 28
28 = 28, so 28 is a perfect number!

Example 3: Checking 12 (Abundant)

Number: 12
Proper divisors: 1, 2, 3, 4, 6
Sum: 1 + 2 + 3 + 4 + 6 = 16
16 > 12, so 12 is abundant (sum exceeds the number)

Example 4: Checking 15 (Deficient)

Number: 15
Proper divisors: 1, 3, 5
Sum: 1 + 3 + 5 = 9
9 < 15, so 15 is deficient (sum is less than the number)

Quick Fact

Only 51 perfect numbers are known today, and they grow astronomically large. The first four (6, 28, 496, 8128) were known to ancient Greek mathematicians. The fifth wasn't discovered until 1456. The largest known perfect number has over 49 million digits - writing it out would fill thousands of books. All known perfect numbers are even; whether any odd perfect numbers exist remains one of mathematics' oldest unsolved problems.

Frequently Asked Questions

What are the first 10 perfect numbers?

The first four are 6, 28, 496, and 8128. The fifth is 33,550,336. After that they explode in size: the sixth is over 8 billion, and by the 10th perfect number, you're dealing with numbers with hundreds of digits. Only 51 perfect numbers have been discovered as of 2024.

Is there a formula for perfect numbers?

Yes, for even perfect numbers. Euclid proved that if 2^p - 1 is prime (a Mersenne prime), then 2^(p-1) × (2^p - 1) is a perfect number. Euler later proved this generates ALL even perfect numbers. Every even perfect number corresponds to a Mersenne prime.

Are there any odd perfect numbers?

Nobody knows. Mathematicians have proven that if an odd perfect number exists, it must be larger than 10^1500, have at least 101 prime factors, and satisfy dozens of other conditions. But no one has proven they can't exist or found one yet.

What's the difference between perfect, abundant, and deficient numbers?

It's about the sum of proper divisors. Perfect: sum equals the number (6: 1+2+3=6). Abundant: sum exceeds the number (12: 1+2+3+4+6=16). Deficient: sum is less than the number (15: 1+3+5=9). Most numbers are deficient.

Why were perfect numbers important to ancient mathematicians?

Ancient Greeks, especially the Pythagoreans, saw mystical significance in perfect numbers. They associated 6 with marriage (union of male 3 and female 2) and considered it the number of creation. Saint Augustine wrote that God created the world in 6 days because 6 is perfect, not vice versa.

Do perfect numbers have any practical applications?

Not directly - they're primarily of theoretical interest in number theory. However, the mathematics behind them (Mersenne primes, divisor functions) connects to cryptography and computer science. The search for large perfect numbers drives development of efficient algorithms for prime testing.

Other Free Tools

Prime Number Checker – Is It Prime? Find Out Instantly

Check if any number is prime or composite instantly with our free online prime number checker. Fast, accurate prime testing for any positive integer with a clear explanation.

Armstrong Number Checker – Verify Narcissistic Numbers

Check if any number is an Armstrong or narcissistic number with our free online tool. Instantly verify whether the sum of each digit raised to the number of digits equals the original number.

Palindrome Number Checker – Is It a Palindrome?

Check if any number is a palindrome with our free online palindrome number checker. Instantly determine whether a number reads the same in both directions.

Digit Sum Calculator – Find Sum of Digits of Any Number

Calculate the sum of all digits in any number with our free online digit sum calculator. Also computes the digital root through repeated digit summation.

Euler's Totient Function Calculator – Compute φ(n) Online

Calculate Euler's totient function φ(n) for any integer with our free online calculator. Find the count of integers up to n that share no common factor with n.

Factor Calculator – Find All Factors of Any Integer

Find all factors of any integer instantly with our free online factor calculator. Lists every factor in ascending order – perfect for simplifying fractions and solving number theory problems.

Divisibility Checker – Test Divisibility Rules Instantly

Check if any number is divisible by another with our free online divisibility checker. Displays the relevant divisibility rule and provides instant yes or no results.

Prime Factorization Calculator – Find Prime Factors Instantly

Find the prime factorization of any number with our free online calculator. Displays all prime factors in exponential form and as a factor tree for easy understanding.