Mathwords logoMathwords

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 nn is abundant if the sum of its proper divisors (all positive divisors except nn) is greater than nn. Using the divisor-sum function σ(n)\sigma(n), which adds every positive divisor of nn including nn, the condition is σ(n)>2n\sigma(n) > 2n. The difference σ(n)−2n\sigma(n) - 2n is called the abundance of nn. When the proper divisors sum to exactly nn, the number is perfect. When they sum to less than nn, the number is deficient.

Key Formula

s(n)=σ(n)−n>n⟺σ(n)>2ns(n) = \sigma(n) - n > n \quad\Longleftrightarrow\quad \sigma(n) > 2n
Where:
  • nn = The positive integer being tested
  • σ(n)\sigma(n) = The sum of all positive divisors of n, including n itself
  • s(n)s(n) = 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.
1, 2, 4, 5, 101,\ 2,\ 4,\ 5,\ 10
Step 2: Add the proper divisors.
s(20)=1+2+4+5+10=22s(20) = 1 + 2 + 4 + 5 + 10 = 22
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.
22>20,22−20=222 > 20, \qquad 22 - 20 = 2
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.

Related Terms

  • Factor of an Integer — Defines the divisors you add to test abundance
  • Factor — Basic idea behind listing every proper divisor
  • Prime Factorization — Lets you compute the divisor sum quickly
  • Factor Tree — Visual method for finding the prime factors first
  • Prime Divisor — Prime divisors build every divisor in the sum
  • Proper Divisor — Defines the factors that are summed, excluding the number itself
  • Perfect Number — Proper divisors sum to exactly n, the boundary between abundant and deficient