Superabundant number

Superabundant number

In mathematics, a superabundant number (sometimes abbreviated as SA) is a certain kind of natural number. Formally, a natural number "n" is called superabundant precisely when, for any "m" < "n",

:frac{sigma(m)}{m} < frac{sigma(n)}{n}

where "σ" denotes the sum-of-divisors function (i.e., the sum of all positive divisors of "n", including "n" itself). The first few superabundant numbers are 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, ... OEIS|id=A004394; superabundant numbers are closely related to highly composite numbers. All superabundant numbers are highly composite numbers, but 7560 is a counterexample of the converse.

Superabundant numbers were first defined in [AlaErd44] .


Leonidas Alaoglu and Paul Erdős proved [AlaErd44] that if "n" is superabundant, then there exist "a"2, ..., "a""p" such that



:a_2geq a_3geqdotsgeq a_p

In fact, "a""p" is equal to 1 except when n is 4 or 36.

Alaoglu and Erdős observed that all superabundant numbers are highly abundant. It can also be shown that all superabundant numbers are Harshad numbers.

External links

* [ MathWorld: Superabundant number]


* [AlaErd44] - Leonidas Alaoglu and Paul Erds, "On Highly Composite and Similar Numbers", Trans. AMS 56, 448-469 (1944)

Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • 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

  • 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… …   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

  • 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

  • 12 (number) — ← 11 13 → 12 ← 10 11 12 13 14 15 16 …   Wikipedia

  • 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

  • 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

  • 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

  • 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”