Term: Abundant Number
Definition: A number for which the sum of its proper divisors is greater than the number itself, or equivalently, its abundancy index is greater than 2 (σ(n) > 2n).
Chapter 1: The Overly Generous Friend (Elementary School Understanding)
Imagine numbers can be friends, and their "sharing buddies" are all the numbers that can divide into them perfectly (except for themselves).
Let's look at the number 12. Its sharing buddies are 1, 2, 3, 4, and 6.
To see how generous 12 is, we add up all its buddies:
1 + 2 + 3 + 4 + 6 = 16.
The number 12 is very special. The sum of its buddies (16) is bigger than the number itself (12)! It's like a friend who gives away more presents than they keep for themselves. Because it's so generous, we call it an abundant number. It has an abundance—more than enough—of friendship to share.
Not all numbers are like this. We saw that 6 is a "perfectly friendly" number because its buddies add up to exactly 6. And 10 is a "lonely" number because its buddies only add up to 8. An abundant number is one that is "extra friendly" or "overly generous."
Chapter 2: More Than Perfect (Middle School Understanding)
You may have heard of perfect numbers, like 6, where the sum of its proper divisors equals the number itself (1+2+3 = 6). An abundant number is a number that goes beyond perfect.
The rule is simple: a number is abundant if the sum of its proper divisors is greater than the number.
Proper Divisors: All divisors of a number, excluding the number itself.
Let's test the number 18:
Proper divisors of 18 are: {1, 2, 3, 6, 9}.
Sum of proper divisors = 1 + 2 + 3 + 6 + 9 = 21.
Since 21 is greater than 18, the number 18 is abundant.
Alternatively, we can use the Abundancy Index, I(n) = σ(n)/n, where σ(n) is the sum of all divisors. A number is abundant if its index is greater than 2.
For 18:
σ(18) = 1 + 2 + 3 + 6 + 9 + 18 = 39.
I(18) = 39 / 18 ≈ 2.17.
Since 2.17 > 2, 18 is confirmed to be abundant.
The first abundant number is 12. Interestingly, while there are many small even abundant numbers, the first odd abundant number is much larger: 945.
Chapter 3: The Building Blocks of Abundance (High School Understanding)
An abundant number is any integer n where σ(n) > 2n. Whether a number is abundant is determined entirely by its prime factorization. Abundance is typically achieved in one of two ways:
Having many distinct, small prime factors.
Having high powers of small prime factors.
We use the multiplicative property of the Abundancy Index, I(n) = I(p₁^a₁) * I(p₂^a₂) * ..., to test for abundance. The goal is to see if this product exceeds 2.
Example: Why is 180 abundant?
Prime Factorization: 180 = 18 × 10 = (2 × 3²) × (2 × 5) = 2² × 3² × 5¹
Calculate the Index for each component:
I(2²) = I(4) = σ(4)/4 = (1+2+4)/4 = 7/4
I(3²) = I(9) = σ(9)/9 = (1+3+9)/9 = 13/9
I(5¹) = I(5) = σ(5)/5 = (1+5)/5 = 6/5
Multiply the Indices:
I(180) = (7/4) × (13/9) × (6/5) = (7 × 13 × 6) / (4 × 9 × 5) = 546 / 180 = 3.033...
Conclusion: Since 3.033... is significantly greater than 2, 180 is a strongly abundant number.
This shows that combining the "generosity" of several prime factors can easily create abundance. Any multiple of a perfect number, and any multiple of an abundant number, is also abundant. This guarantees that there are infinitely many abundant numbers.
Chapter 4: Density and Distribution (College Level Understanding)
The set of abundant numbers, denoted A, is a significant and well-studied subset of the positive integers. Its properties are non-trivial and connect to deeper concepts in analytic number theory.
Infinite Set: The set A is infinite. This can be proven constructively. If n is an abundant number (so σ(n) > 2n), then for any integer k > 1, its multiple kn is also abundant. The proof relies on showing σ(kn) > kσ(n), which leads to σ(kn) > k(2n) = 2kn. The same holds for any multiple of a perfect number.
Positive Natural Density: The set of abundant numbers is not sparse. In fact, it has a well-defined natural density, which is the limit lim(N→∞) |A ∩ {1,...,N}| / N. In 1998, Marc Deléglise proved that this density is between 0.2474 and 0.2480. This means that roughly one in every four integers is abundant.
Odd Abundant Numbers: The smallest is 945 = 3³ × 5 × 7. While it is known that there are infinitely many abundant numbers, it is not yet proven that there are infinitely many odd abundant numbers, though it is strongly conjectured to be true.
Related Concepts:
Weird Numbers: A number is weird if it is abundant, but no subset of its proper divisors sums to the number itself. The smallest weird number is 70. σ(70) = 144 > 140, so it is abundant. But no combination of its proper divisors {1, 2, 5, 7, 10, 14, 35} sums to 70.
Pseudoperfect Number: A number that is equal to the sum of some of its proper divisors. All perfect numbers are pseudoperfect. Abundant numbers that are not weird are also pseudoperfect.
The study of abundant numbers is therefore not just about a simple classification but about the distribution, density, and subtle structural properties of a significant portion of the integers.
Chapter 5: Worksheet - Identifying Abundance
Part 1: Generous Friends (Elementary Level)
The number 14 has sharing buddies {1, 2, 7}. Is 14 an abundant number? Why or why not?
The number 24 has sharing buddies {1, 2, 3, 4, 6, 8, 12}. Is 24 an abundant number?
Part 2: Using the Index (Middle School Level)
Calculate the Abundancy Index I(30) = σ(30)/30. Is 30 deficient, perfect, or abundant?
The first odd abundant number is 945. Its divisors are 1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 63, 105, 135, 189, 315, and 945. You are given that σ(945) = 1920. Calculate I(945) and confirm that it is abundant.
Part 3: Prime Factor Method (High School Level)
The prime factorization of 72 is 2³ × 3². Calculate I(72) using the multiplicative property of the index. Is 72 abundant?
Prove that any multiple of 12 (other than 12 itself) must be abundant. (Hint: let the number be 12k where k > 1. Think about the divisors.)
Is n = 2 × 3 × 5 × 7 = 210 an abundant number? Show your work using the index for each prime factor.
Part 4: Deeper Properties (College Level)
Explain what it means for the abundant numbers to have a "positive natural density" of approximately 0.247.
The number 6 is a perfect number. Prove that any multiple of 6, 6k for k > 1, must be abundant.
The number 70 is the smallest "weird number."
First, prove that 70 is abundant. Its prime factorization is 2 × 5 × 7.
Second, list its proper divisors and try to find a subset that sums to exactly 70 to understand why it's called "weird."