Highly abundant number

Highly abundant number

In mathematics, a highly abundant number is a natural number where the sum of its divisors (including itself) is greater than the sum of the divisors of any natural number less than it.

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 log2 "N". They also proved that 7200 is the largest powerful highly abundant number, and therefore the largest highly abundant number with odd sum of divisors.

Formal definition and examples

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

:sigma(n) > sigma(m)

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, ... OEIS|id=A002093.

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 σ.

Relations with other sets of numbers

Some sources report that all factorials are highly abundant numbers, but this is incorrect.:σ(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 Nicolas (1969).

Despite the terminology, not all highly abundant numbers are abundant numbers. In particular, none of the first seven highly abundant numbers are abundant.

References

*cite journal
author = Alaoglu, L.; Erdős, P.
title = On highly composite and similar numbers
journal = Transactions of the American Mathematical Society
volume = 56
year = 1944
pages = 448–469
id = MathSciNet | id = 0011087
doi = 10.2307/1990319

*cite journal
author = Nicolas, Jean-Louis
title = Ordre maximal d'un élément du groupe "Sn" des permutations et "highly composite numbers"
journal = Bull. Soc. Math. France
volume = 97
year = 1969
pages = 129–191
id = MathSciNet | id = 0254130
url = http://www.numdam.org/item?id=BSMF_1969__97__129_0

*cite journal
author = Pillai, S. S.
authorlink = Subbayya Sivasankaranarayana Pillai
title = Highly abundant numbers
journal = Bull. Calcutta Math. Soc.
volume = 35
year = 1943
pages = 141–156
id = MathSciNet | id = 0010560


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Highly composite number — This article is about numbers having many divisors. For numbers factorized only to powers of 2, 3, 5 and 7 (also named 7 smooth numbers), see Smooth number. A highly composite number (HCN) is a positive integer with more divisors than any… …   Wikipedia

  • Colossally abundant number — In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a natural number that, in some rigorous sense, has a lot of divisors. Formally, a number n is colossally abundant if and only if there is an ε > 0 such… …   Wikipedia

  • number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

  • Deficient number — In number theory, a deficient number or defective number is a number n for which the sum of divisors σ(n)<2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n)<n. The value 2n − σ(n) (or n − s(n)) is… …   Wikipedia

  • Perfect number — In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect… …   Wikipedia

  • Composite number — A composite number is a positive integer which has a positive divisor other than one or itself. In other words a composite number is any positive integer greater than one that is not a prime number. So, if n > 0 is an integer and… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Pronic number — A pronic number, oblong number, rectangular number or heteromecic number, is a number which is the product of two consecutive integers, that is, n (n + 1). The n th pronic number is twice the n th triangular number and n more than… …   Wikipedia

  • Multiply perfect number — In mathematics, a multiply perfect number (also called multiperfect number or pluperfect number) is a generalization of a perfect number. For a given natural number k, a number n is called k perfect (or k fold perfect) if and only if the sum of… …   Wikipedia

  • Harmonic divisor number — This article is about harmonic divisor numbers. For meanings of harmonic number, see harmonic number (disambiguation). In mathematics, a harmonic divisor number, or Ore number (named after Øystein Ore who defined it in 1948), is a positive… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”