Abundant Numbers

While we often judge numbers by their size, an ancient and fascinating perspective from number theory classifies them by their "generosity"—the sum of their divisors. This approach categorizes integers into three distinct families: deficient, perfect, and the richly overflowing abundant numbers. Though less famous than prime numbers, this classification unlocks a world of hidden patterns and deep mathematical structure. This article delves into the world of abundant numbers, addressing the question of what they are, how they behave, and why they matter. In the following chapters, we will first explore the "Principles and Mechanisms" that define abundance, learning to identify these numbers and understanding their fundamental properties. Subsequently, the "Applications and Interdisciplinary Connections" chapter will reveal the constructive power and surprising implications of this concept, from building intricate number families to its startling link with the Riemann Hypothesis.

In our journey through the world of numbers, we often focus on their size. Is 7 larger than 5? How many digits does a googolplex have? But what if we were to judge a number not by its magnitude, but by the richness of its relationships—by the family of numbers that divide it evenly? This perspective, as old as the ancient Greeks, opens up a new and beautiful way to classify the integers, revealing a hidden personality within each one.

Let's start with a simple idea. For any number $n$, we can gather all its positive divisors. For the number 6, its family of divisors is $\{1, 2, 3, 6\}$. For 10, it's $\{1, 2, 5, 10\}$. The first tool we'll use is the ​​sum of divisors function​​, denoted by the Greek letter sigma, $\sigma(n)$. This is simply the sum of all numbers in that family.

So, for our examples:

• $\sigma(6) = 1 + 2 + 3 + 6 = 12$
• $\sigma(10) = 1 + 2 + 5 + 10 = 18$

The ancient mathematicians, however, were particularly interested in a number's "friends"—its proper divisors, which are all divisors except the number itself. Let's call the sum of these proper divisors $s(n)$. For 6, the proper divisors are $\{1, 2, 3\}$, so $s(6) = 1+2+3 = 6$. Notice that the set of all divisors is just the set of proper divisors plus the number $n$ itself. This gives us a wonderfully simple and fundamental relationship between our two sums:

This little equation is the key that unlocks the entire classification. The Greeks defined a number's character by comparing it to the sum of its friends, $s(n)$:

• ​​Perfect Numbers​​: If a number is exactly equal to the sum of its proper divisors ($s(n) = n$), it is called ​​perfect​​. Our example, 6, is the smallest perfect number. Its friends sum up to exactly itself, a perfect balance. Using our key equation, this is the same as saying $\sigma(n) - n = n$, or more simply, $\sigma(n) = 2n$.

• ​​Deficient Numbers​​: If a number is greater than the sum of its proper divisors ($s(n) n$), it is called ​​deficient​​. Take the number 9. Its proper divisors are 1 and 3, so $s(9) = 1+3=4$. Since $4 9$, the number 9 is deficient. It's as if the number is "lonely," its friends don't quite add up to its own stature. This condition is equivalent to $\sigma(n) 2n$.

• ​​Abundant Numbers​​: If a number is less than the sum of its proper divisors ($s(n) > n$), it is called ​​abundant​​. This is the focus of our story. An abundant number is one whose friends, when added together, "overflow" the number itself. Consider 12. Its proper divisors are $\{1, 2, 3, 4, 6\}$, and their sum is $s(12) = 1+2+3+4+6 = 16$. Since $16 > 12$, the number 12 is abundant. This condition is equivalent to $\sigma(n) > 2n$.

While comparing $\sigma(n)$ to $2n$ works perfectly well, it can feel a bit like comparing apples and oranges as $n$ gets larger. A more elegant and powerful way to think about this is to create a single, normalized measure of a number's "generosity." We call this the ​​abundancy index​​, $I(n)$, defined as:

This index tells us how large the sum of divisors is as a multiple of the number itself. Using our previous examples:

• For the perfect number 6, $I(6) = \frac{\sigma(6)}{6} = \frac{12}{6} = 2$.
• For the deficient number 9, $I(9) = \frac{\sigma(9)}{9} = \frac{13}{9} \approx 1.44$.
• For the abundant number 12, $I(12) = \frac{\sigma(12)}{12} = \frac{28}{12} = \frac{7}{3} \approx 2.33$.

Suddenly, the classification becomes beautifully simple. The magic number is 2.

• $n$ is ​​perfect​​ if and only if $I(n) = 2$.
• $n$ is ​​deficient​​ if and only if $I(n) 2$.
• $n$ is ​​abundant​​ if and only if $I(n) > 2$.

This index has a lovely alternative interpretation. Since $\sigma(n) = \sum_{d|n} d$, we can write $I(n) = \frac{1}{n} \sum_{d|n} d = \sum_{d|n} \frac{d}{n}$. Every term $\frac{d}{n}$ is the reciprocal of some other divisor of $n$. (For example, if $d$ is a divisor, then $n/d$ is also a divisor, and $\frac{d}{n} = \frac{1}{n/d}$). So, the abundancy index is also the sum of the reciprocals of all the divisors of $n$!

For any number $n > 1$, its divisors always include 1 and $n$. So its abundancy index must be at least $1 + \frac{1}{n}$, which is always greater than 1. The question of abundance is really a question of how much greater than 1 the index can get. Can it cross the threshold of 2?

Armed with our new yardstick, let's go on an expedition to find our first abundant number. We can start from 1 and work our way up.

• $n=1$: Divisors $\{1\}$, $\sigma(1)=1$, $I(1)=1$. Deficient.
• $n=2$ (a prime): Divisors $\{1, 2\}$, $\sigma(2)=3$, $I(2)=\frac{3}{2}=1.5$. Deficient.
• $n=3$ (a prime): Divisors $\{1, 3\}$, $\sigma(3)=4$, $I(3)=\frac{4}{3} \approx 1.33$. Deficient.

Wait, let's look at all prime numbers, $p$. Their only divisors are 1 and $p$. So, $\sigma(p) = 1+p$. Their abundancy index is $I(p) = \frac{1+p}{p} = 1 + \frac{1}{p}$. Since the smallest prime is 2, the largest this index can be is $1+\frac{1}{2} = 1.5$. For any prime $p$, $I(p)$ is always greater than 1 but strictly less than 2. This gives us a remarkable result: ​​every prime number is deficient​​.

What about powers of primes, like $n=p^k$? For $n=4=2^2$, divisors are $\{1,2,4\}$, $\sigma(4)=7$, $I(4) = \frac{7}{4}=1.75$. Still deficient. What about $n=27=3^3$? Divisors are $\{1,3,9,27\}$, $\sigma(27)=40$, $I(27)=\frac{40}{27} \approx 1.48$. Still deficient. In fact, one can prove a general rule: ​​every power of a prime is a deficient number​​. This means that to find an abundant number, we must be looking for a composite number that isn't just the power of a single prime. It needs a mix of different prime factors.

Let's continue our hunt:

• $n=5$ (prime): Deficient.
• $n=6=2 \times 3$: Divisors $\{1,2,3,6\}$, $\sigma(6)=12$, $I(6)=\frac{12}{6}=2$. Aha! A perfect number. We're getting closer.
• $n=7, 8=2^3, 9=3^2, 10=2 \times 5, 11$: All are deficient.
• $n=12=2^2 \times 3$: Divisors $\{1,2,3,4,6,12\}$, $\sigma(12)=28$, $I(12)=\frac{28}{12}=\frac{7}{3} \approx 2.33$. We've crossed the threshold! $I(12)>2$. We've found it: ​​12 is the smallest abundant number​​.

Now that we know abundant numbers exist, we can ask how they behave. Is there an "algebra" of abundance? What happens when we combine them?

A natural question is whether the product of two deficient numbers is also deficient. We've seen that the primes 2 and 3 are both deficient. Their product is 6, which is perfect. So the property of "deficiency" is not closed under multiplication. It can change.

Can the product become abundant? Let's try another example. The number 16 is deficient, with $I(16) = \frac{31}{16} 2$. The number 21 is also deficient, with $I(21) = \frac{32}{21} 2$. What about their product, $16 \times 21 = 336$? Because 16 and 21 are coprime, the abundancy index multiplies: $I(336) = I(16) \times I(21) = \frac{31}{16} \times \frac{32}{21} = \frac{31 \times 2}{21} = \frac{62}{21}$. Since $62 > 2 \times 21 = 42$, we have $I(336) > 2$. The product of two deficient numbers has become abundant!. This shows that building abundant numbers is a subtle process of combining factors in just the right way. To become abundant, a number needs "help" from many small prime factors.

What about multiples? This is where we find a shockingly simple and powerful law. Let's say we have an abundant number, $A$. This means its divisors sum to more than twice itself: $\sigma(A) > 2A$. Now consider any multiple of $A$, let's call it $n = kA$ for some integer $k>1$. Let the divisors of $A$ be $\{d_1, d_2, \ldots, d_m\}$. The numbers $\{kd_1, kd_2, \ldots, kd_m\}$ are all divisors of $n$. They might not be all the divisors of $n$, but they are a subset. Let's sum this subset of divisors: $\sum_{i=1}^m kd_i = k \sum_{i=1}^m d_i = k\sigma(A)$ Since we know $A$ is abundant, we know $\sigma(A) > 2A$. So, the sum of this subset of divisors is $k\sigma(A) > k(2A) = 2(kA) = 2n$. The full sum of divisors of $n$, $\sigma(n)$, must be at least as large as the sum of this subset. Therefore: $\sigma(n) \ge k\sigma(A) > 2n$ This proves that $\sigma(n) > 2n$, which means $n$ is abundant! The same logic shows that any multiple of a perfect number is also abundant. This is a beautiful rule of inheritance: ​​any positive integer multiple of an abundant (or perfect) number is also abundant​​. This means that once we've found our first abundant number, 12, we've instantly found an infinite family: 24, 36, 48, 60, and so on, are all abundant. The same holds for any other abundant numbers we find, like 18 or 20. Abundance, once achieved, is never lost by multiplication.

We've discovered infinite families of abundant numbers. This might lead you to believe they are very common. But we also found that vast categories of numbers—all primes and all powers of primes—are deficient. So, what is the final verdict? If you were to pick a very large number at random, would it more likely be abundant or deficient?

To answer this, mathematicians don't just count, they look at averages. What is the average value of the abundancy index, $I(n)$, across all integers? This is a deep question, but the answer is surprisingly concrete. Using powerful techniques, it can be shown that the sum of all $\sigma(n)$ up to some large number $x$ behaves very predictably:

This isn't an idle formula; it reveals a profound structure in the integers. With a little more mathematical wizardry, we can use this to find the average value of $I(n)$. The result is a famous constant from a completely different area of mathematics:

Think about what this means. The threshold for abundance is 2. The average value of a number's "generosity index" across the entire universe of integers is only about 1.645. This provides powerful heuristic evidence that the abundant numbers, with their indices greater than 2, must be the exception, not the rule. The vast majority of numbers must be deficient, pulling the average down below the perfect threshold of 2.

This intuition turns out to be correct. While there are infinitely many abundant numbers, they are a minority. It has been proven that the "density" of abundant numbers—the probability that a randomly chosen integer is abundant—is a specific, un-round number, approximately 0.2476. This means that just under one in every four numbers is abundant. They are neither vanishingly rare nor overwhelmingly common. They exist as a significant and fascinating sub-population in the grand cosmos of integers, a testament to the fact that even in the simple act of addition and division, there are endless patterns and wonders to discover.

Having understood the principles that classify numbers as abundant, deficient, or perfect, one might be tempted to think of this as a mere labeling exercise, a way for mathematicians to neatly sort integers into different bins. But that would be like looking at a chess piece and only describing its shape, without understanding how it moves or what role it plays in the game. The true beauty and power of these concepts emerge when we see them in action. This classification is not an end, but a beginning—the first step into a world of surprising constructions, intricate dynamics, and connections to some of the deepest questions in all of mathematics.

If we have a number that is deficient, is it doomed to stay that way? Not at all! We can think of the abundancy index, $I(n) = \sigma(n)/n$, as a kind of lever. The threshold for abundance is $I(n) > 2$. Since the index is multiplicative, we can add new prime factors to "push" the lever. The most effective push comes from the smallest primes. For instance, the index of any power of 2, $I(2^k) = 2 - 1/2^k$, always stays just shy of 2. But this means we can take an odd deficient number, say $m$, and by multiplying it by a high enough power of 2, we can push the total index $I(2^k m) = I(2^k)I(m)$ just over the threshold to create an abundant number. We are, in a sense, engineering abundance.

This idea of using small primes to efficiently boost the abundancy index has a profound consequence. If we construct numbers by multiplying together all the primes up to some value $y$, we get the "primorials," $n(y) = \prod_{p \le y} p$. The abundancy index for such a number is $I(n(y)) = \prod_{p \le y} (1 + 1/p)$. It is a classic result of mathematics that the sum of the reciprocals of the primes, $\sum 1/p$, diverges—it grows without bound. This, in turn, implies that the product for $I(n(y))$ also grows without bound as we include more primes. Therefore, not only can we find an abundant number, but we can be certain that there are infinitely many of them; we just need to build a primorial large enough. This constructive approach gives us a glimpse into the vast, infinite landscape of abundant numbers. We can even engage in fine-tuning, carefully selecting prime factors and their exponents to create numbers that are just barely abundant, with an index a hair's breadth above 2.

As we explore this vast landscape, we begin to notice a finer structure, a "zoology" of different kinds of abundant numbers. A natural question arises: what are the most fundamental abundant numbers? This leads us to the concept of ​​primitive abundant numbers​​: these are abundant numbers whose proper divisors are all deficient. The number 20 is the first such number. These primitives are the true building blocks; any other abundant number is simply a multiple of a perfect number or a primitive abundant number. Algorithms can be designed to systematically generate these fundamental units by ensuring that as we build a number up from its prime factors, it only crosses the abundance threshold at the very last step, with all its constituent parts remaining deficient.

But there is another, stranger way to classify them. An abundant number $n$ is defined by the fact that the sum of its proper divisors, $s(n)$, is greater than $n$. One might naturally assume that with such a surplus of divisors, it should always be possible to pick a select few of them that add up to $n$ itself. Numbers for which this is true are called ​​semiperfect​​. For example, 12 is abundant ($s(12)=16$) and semiperfect (since $2+4+6=12$). If a number is abundant and semiperfect, its set of proper divisors can be neatly partitioned into two groups: one whose members sum to $n$, and the other whose members sum to the "excess," $s(n)-n$.

But here lies a wonderful twist. It turns out that some abundant numbers are not semiperfect. These are the aptly named ​​weird numbers​​. The smallest is 70. It is abundant because the sum of its proper divisors is $s(70)=74$, which is greater than 70. However, there is no subset of its proper divisors {1, 2, 5, 7, 10, 14, 35} that adds up to 70. This is a beautiful, counter-intuitive fact: having "too much" doesn't guarantee you have just the right amount in some combination.

So far, we have treated abundance as a static property. But it is also the engine of a simple, yet famously unpredictable, dynamical system. If we start with a number $n$ and repeatedly apply the function $s(n)$, we generate an ​​aliquot sequence​​: $n, s(n), s(s(n)), \dots$. The initial classification of $n$ tells us exactly how this dance begins.

• If $n$ is ​​perfect​​, $s(n)=n$. The sequence is a fixed point: $n, n, n, \dots$.
• If $n$ is ​​deficient​​, $s(n) n$. The sequence starts by decreasing. For a prime number, it immediately terminates at 1.
• If $n$ is ​​abundant​​, $s(n) > n$. The sequence starts by increasing.

This first step, however, tells us little about the long-term fate of the sequence. An increasing step can be followed by a decrease, and vice-versa. The sequences can terminate, grow seemingly without bound, or, most elegantly, fall into a periodic cycle. A cycle of length 2 gives us an amicable pair. But longer cycles also exist, called ​​sociable numbers​​. For instance, there is a known cycle of length 5 that begins with 12496. What is fascinating is that this cycle contains a mix of abundant and deficient numbers; the sequence rises and falls as it cycles through the five numbers, with the sum of all the "abundancy surpluses" and "deficiency deficits" around the cycle perfectly balancing out to zero. The statistical distribution of the abundancy index across all integers is thought to govern the likelihood of these different behaviors, with numbers rich in small prime factors being more likely to start and sustain these "abundance-driven growth phases".

We have journeyed from simple definitions to construction, classification, and dynamics. We end at the summit, with a connection that is as profound as it is unexpected. The story of abundance, it turns out, is inextricably linked to one of the greatest unsolved problems in mathematics: the ​​Riemann Hypothesis (RH)​​.

The RH is a conjecture about the location of the zeros of a complex function, but it has deep implications for the distribution of prime numbers. So what could it possibly have to do with the sum of a number's divisors? The connection is an astonishing theorem by Guy Robin, which states that the Riemann Hypothesis is true if and only if a certain inequality involving $\sigma(n)$ holds for all integers $n > 5040$: $\sigma(n) e^{\gamma} n \log\log n$ Here, $\gamma$ is the Euler–Mascheroni constant and $\log$ is the natural logarithm. Think of this as a "cosmic speed limit" on how abundant a number can be. The RH, a statement about primes, dictates just how large the ratio $\sigma(n)/n$ can get. If you could find just one integer $n > 5040$ that violates this inequality—a so-called Robin's violator—then the Riemann Hypothesis would be false.

Any such number would have to be extraordinarily abundant. A simple calculation shows that the term $e^{\gamma}\log\log n$ is significantly greater than 2 for $n > 5040$, so any violator would necessarily be an abundant number, and a spectacularly abundant one at that. This reframes one of the most abstract problems in mathematics into a concrete (though impossibly difficult) search for a special integer. The study of abundant numbers, which began with the simple act of adding up divisors, has led us to the very frontier of mathematical knowledge, where the properties of a single integer could hold the key to a century-old mystery.