Highly abundant number

Last updated
Sums of the divisors, in Cuisenaire rods, of the first six highly abundant numbers Highly abundant number Cuisenaire rods 8.png
Sums of the divisors, in Cuisenaire rods, of the first six highly abundant numbers

In mathematics, a highly abundant number is a natural number with the property that the sum of its divisors (including itself) is greater than the sum of the divisors of any smaller natural number.

Contents

Highly abundant numbers and several similar classes of numbers were first introduced by Pillai  ( 1943 ), and early work on the subject was done by Alaoglu and Erdős  ( 1944 ). Alaoglu and Erdős tabulated all highly abundant numbers up to 104, and showed that the number of highly abundant numbers less than any N is at least proportional to log2N.

Formal definition and examples

Formally, a natural number n is called highly abundant if and only if for all natural numbers m<n,

where σ denotes the sum-of-divisors function. The first few highly abundant numbers are

1, 2, 3, 4, 6, 8, 10, 12, 16, 18, 20, 24, 30, 36, 42, 48, 60, ... (sequence A002093 in the OEIS ).

For instance, 5 is not highly abundant because σ(5) = 5+1 = 6 is smaller than σ(4) = 4 + 2 + 1 = 7, while 8 is highly abundant because σ(8) = 8 + 4 + 2 + 1 = 15 is larger than all previous values of σ.

The only odd highly abundant numbers are 1 and 3. [1]

Relations with other sets of numbers

Euler diagram of abundant, primitive abundant, highly abundant, superabundant, colossally abundant, highly composite, superior highly composite, weird and perfect numbers under 100 in relation to deficient and composite numbers Euler diagram numbers with many divisors.svg
Euler diagram of abundant, primitive abundant, highly abundant, superabundant, colossally abundant, highly composite, superior highly composite, weird and perfect numbers under 100 in relation to deficient and composite numbers

Although the first eight factorials are highly abundant, not all factorials are highly abundant. For example,

σ(9!) = σ(362880) = 1481040,

but there is a smaller number with larger sum of divisors,

σ(360360) = 1572480,

so 9! is not highly abundant.

Alaoglu and Erdős noted that all superabundant numbers are highly abundant, and asked whether there are infinitely many highly abundant numbers that are not superabundant. This question was answered affirmatively by Jean-LouisNicolas  ( 1969 ).

Despite the terminology, not all highly abundant numbers are abundant numbers. In particular, none of the first seven highly abundant numbers (1, 2, 3, 4, 6, 8, and 10) is abundant. Along with 16, the ninth highly abundant number, these are the only highly abundant numbers that are not abundant.

7200 is the largest powerful number that is also highly abundant: all larger highly abundant numbers have a prime factor that divides them only once. Therefore, 7200 is also the largest highly abundant number with an odd sum of divisors. [2]

Notes

  1. See Alaoglu & Erdős (1944), p. 466. Alaoglu and Erdős claim more strongly that all highly abundant numbers greater than 210 are divisible by 4, but this is not true: 630 is highly abundant, and is not divisible by 4. (In fact, 630 is the only counterexample; all larger highly abundant numbers are divisible by 12.)
  2. Alaoglu & Erdős (1944), pp. 464–466.

Related Research Articles

Amicable numbers Pair of integers related by their divisors

Amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, σ(a)=b+a and σ(b)=a+b, where σ(n) is equal to the sum of positive divisors of n.

Divisor Integer that is a factor of another integer

In mathematics, a divisor of an integer, also called a factor of , is an integer that may be multiplied by some integer to produce . In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of ; this implies dividing by leaves no remainder.

A highly composite number is a positive integer with more divisors than any smaller positive integer has. The related concept of largely composite number refers to a positive integer which has at least as many divisors as any smaller positive integer. The name can be somewhat misleading, as two highly composite numbers are not actually composite numbers.

Multiply perfect number

In mathematics, a multiply perfect number is a generalization of a perfect number.

Abundant number Number that is less than the sum of its proper divisors

In number theory, an abundant number or excessive number is a number 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 for a total of 16. The amount by which the sum exceeds the number is the abundance. The number 12 has an abundance of 4, for example.

Deficient number Number whose aliquot sum is less than itself

In number theory, a deficient number or defective number is a number n for which the sum of divisors of n is less than 2n. Equivalently, it is a number for which the sum of proper divisors is less than n. For example, the proper divisors of 8 are 1, 2, and 4, and their sum is less than 8, so 8 is deficient.

In mathematics, a quasiperfect number is a natural number n for which the sum of all its divisors is equal to 2n + 1. Equivalently, n is the sum of its non-trivial divisors. No quasiperfect numbers have been found so far.

Divisor function Arithmetic function related to the divisors of an integer

In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer. It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.

120 (number) Natural number

120, read as one hundred [and] twenty, is the natural number following 119 and preceding 121.

An untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at least to Abu Mansur al-Baghdadi, who observed that both 2 and 5 are untouchable.

Practical number Number such that it and all smaller numbers may be represented as sums of its distinct divisors

In number theory, a practical number or panarithmic number is a positive integer such that all smaller positive integers can be represented as sums of distinct divisors of . For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5 = 3 + 2, 7 = 6 + 1, 8 = 6 + 2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2.

5040 is a factorial (7!), a superior highly composite number, abundant number, colossally abundant number and the number of permutations of 4 items out of 10 choices. It is also one less than a square, making a Brown number pair.

In mathematics, a superabundant number is a certain kind of natural number. A natural number n is called superabundant precisely when, for all m < n

Colossally abundant number Concept in mathematics

In mathematics, a colossally abundant number is a natural number that, in a particular, rigorous sense, has many divisors. Formally, a number n is said to be colossally abundant if there is an ε > 0 such that for all k > 1,

225 is the natural number following 224 and preceding 226.

In number theory, friendly numbers are two or more natural numbers with a common abundancy index, the ratio between the sum of divisors of a number and the number itself. Two numbers with the same "abundancy" form a friendly pair; n numbers with the same "abundancy" form a friendly n-tuple.

288 is the natural number following 287 and preceding 289. Because 288 = 2 · 12 · 12, it may also be called "two gross" or "two dozen dozen".

Leonidas (Leon) Alaoglu was a mathematician, known for his result, called Alaoglu's theorem on the weak-star compactness of the closed unit ball in the dual of a normed space, also known as the Banach–Alaoglu theorem.

In number theory, the aliquot sums(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself. That is,

840 is the natural number following 839 and preceding 841.

References