Abundant number

Demonstration, with Cuisenaire rods, of the abundance of the number 12

In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. The integer 12 is the first abundant number: its proper divisors are 1, 2, 3, 4 and 6, and their sum 16 is larger than 12. The amount by which the sum exceeds the number is the abundance. The number 12 has an abundance of 4, for example.

Definition and examples

An abundant number is a natural number Template:Math for which the sum of divisors Template:Math satisfies Template:Math, or, equivalently, the sum of proper divisors (or aliquot sum) Template:Math satisfies Template:Math.Template:RTemplate:RTemplate:RTemplate:R The abundance of a natural number is the integer Template:Math (equivalently, Template:Math).Template:R

The abundant numbers smaller than 100 are

12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, and 96 Template:OEIS.

For example, the proper divisors of 24 are 1, 2, 3, 4, 6, 8, and 12, whose sum is 36. Because 36 is greater than 24, the number 24 is abundant, and its abundance is Template:Math.

Numbers that are not abundant are either perfect (if Template:Math) or deficient (if Template:Math).

Properties

Let $a(n)$ be the number of abundant numbers not exceeding $n$. Plot of $a(n)/n$ for $n<10^6$ (with $n$ log-scaled)

Every multiple of an abundant number is abundant.Template:RTemplate:R For example, every multiple of 20 (including 20 itself) is abundant because if Template:Mvar is a multiple of 20 then $\sigma (n)\ge \frac{n}{2}+\frac{n}{4}+\frac{n}{5}+\frac{n}{10}+\frac{n}{20}=n+\frac{n}{10}.$ Similarly, every multiple of a perfect number (except the perfect number itself) is abundant.Template:R For example, every multiple Template:Mvar of 6 greater than 6 is abundant because $\sigma (n)\ge 1+\frac{n}{2}+\frac{n}{3}+\frac{n}{6}=n+1.$ An abundant number that is not the multiple of an abundant number or perfect number (i.e., whose proper divisors are all deficient) is called a primitive abundant number.

Unlike for perfect numbers, even and odd abundant numbers are known to exist. The smallest odd abundant number is 945.Template:R Consequently, infinitely many abundant numbers exist with each parity. The smallest abundant number that is not divisible by 2 or by 3 is 5391411025; its distinct prime factors are 5, 7, 11, 13, 17, 19, 23, and 29. An algorithm given by Iannucci in 2005 shows how to find the smallest abundant number not divisible by the first k primes Template:OEIS. If $A(k)$ represents the smallest abundant number not divisible by the first k primes then for all $ϵ>0$ we have $$(1-ϵ)(k\ln k{)}^{2-ϵ}<\ln A(k)<(1+ϵ)(k\ln k{)}^{2+ϵ}$$ for sufficiently large k.

The set of abundant numbers has a non-zero natural density: that is, as Template:Mvar grows large, the fraction of the natural numbers less than Template:Mvar that are abundant approaches a constant. This limiting fraction lies between 0.2476171 and 0.2476475.

The first pair of consecutive abundant numbers is (5775, 5776), and the first consecutive triple is (171078830, 171078831, 171078832). Let $E(n)$ be the length of the longest run of consecutive abundant numbers not exceeding $n$. Paul Erdős (1935) showed that there exists two constants $c_1,c_2$ such that $c_1\log \log \log n\le E(n)\le c_2\log \log \log n$ for all sufficiently large $n$. As a matter of fact, the limit $$\underset{n\to \mathrm{\infty }}{lim}\frac{E(n)}{\log \log \log n}$$ exists, with value lying between 3.24 and 3.54.

Every integer greater than 20161 can be written as the sum of two abundant numbers.Template:R The largest even number that is not the sum of two abundant numbers is 46.

Related concepts

Template:Euler diagram numbers with many divisors.svg Numbers whose sum of proper factors equals the number itself (such as 6 and 28) are called perfect numbers,Template:RTemplate:R while numbers whose sum of proper factors is less than the number itself are called deficient numbers.Template:RTemplate:R The first known classification of numbers as deficient, perfect or abundant was by Nicomachus in his Introductio Arithmetica (ca. 100 CE) and by Theon of Smyrna in his On Mathematics Useful for the Understanding of Plato (ca. 100 CE).Template:RTemplate:R

The abundancy index of Template:Mvar is the ratio Template:Math.Template:R A number whose abundancy index is greater than any lower number is called a superabundant number Template:OEIS.Template:R Distinct numbers n₁, n₂, ... (whether abundant or not) with the same abundancy index are called friendly numbers.

The sequence (a_k) of least numbers n such that σ(n) > kn, in which a₂ = 12 corresponds to the first abundant number, grows very quickly Template:OEIS. The smallest odd integer with abundancy index exceeding 3 is 1018976683725 = 3³ × 5² × 7² × 11 × 13 × 17 × 19 × 23 × 29.

If p = (p₁, ..., p_n) is a list of primes, then p is termed abundant if some integer composed only of primes in p is abundant. A necessary and sufficient condition for this is that the product of the numbers $\frac{p_k}{p_k-1}$ be larger than 2.

A number Template:Mvar for which the sum of its divisors (including itself) is greater than the sum of the divisors of any smaller natural number is called a highly abundant number.

An abundant number which is not a semiperfect number is called a weird number.Template:R An abundant number with abundance 1 is called a quasiperfect number; it is not known whether any quasiperfect numbers exist.

External links

• The Prime Glossary: Abundant number
• Template:PlanetMath