Abundant Number — Definition, Formula & Example
An abundant number is a positive whole number whose factors, not counting the number itself, add up to more than the number. The smallest one is 12, because 1 + 2 + 3 + 4 + 6 = 16, and 16 is greater than 12.
A positive integer is abundant if the sum of its proper divisors (all positive divisors except ) is greater than . Using the divisor-sum function , which adds every positive divisor of including , the condition is . The difference is called the abundance of . When the proper divisors sum to exactly , the number is perfect. When they sum to less than , the number is deficient.
Key Formula
Where:
- = The positive integer being tested
- = The sum of all positive divisors of n, including n itself
- = The sum of the proper divisors of n, which excludes n
Worked Example
Problem: Is 20 an abundant number? If it is, find its abundance.
Step 1: List the proper divisors of 20. These are all the positive divisors except 20 itself.
Step 2: Add the proper divisors.
Step 3: Compare the sum to 20. Since 22 is greater than 20, the number is abundant. The abundance is the amount by which the sum is too large.
Answer: Yes. The proper divisors of 20 sum to 22, which is greater than 20. So 20 is abundant, and its abundance is 2.
Why It Matters
Abundant numbers belong to a classic three-way sorting of the positive integers into deficient, perfect, and abundant numbers, which the ancient Greeks studied. They give good practice in listing divisors systematically, a skill you reuse when you find a GCF or an LCM. Most abundant numbers are even. The smallest odd one is 945, a fact that surprises many students.
Common Mistakes
Mistake: Including the number itself in the divisor sum and then comparing that sum to the number. For example, a student adds 1 + 2 + 4 + 5 + 10 + 20 = 42, compares 42 to 20, and would wrongly call almost every number abundant.
Correction: Choose one method and stick with it. You can leave n out and compare the sum to n (22 > 20). Or you can include n and compare the sum to 2n (42 > 40). Mixing the two methods gives wrong answers.
