Superior highly composite number
- Superior highly composite number
In mathematics, a superior highly composite number is a certain kind of natural number. Formally, a natural number "n" is called superior highly composite iff there is an ε > 0 such that for all natural numbers "k" ≥ 1,
:
where "d"("n"), the divisor function, denotes the number of divisors of "n". The first few superior highly composite numbers are 2, 6, 12, 60, 120, 360, 2520, 5040, 55440, 720720, 1441440, 4324320, 21621600, 367567200... OEIS|id=A002201.
Properties
All superior highly composite numbers are highly composite; it can also be shown that there exist prime numbers π1, π2, ... such that the "n"-th superior highly composite number "s""n" can be written as
:
The first few π"n" are 2, 3, 2, 5, 2, 3, 7, ... OEIS|id=A000705.
References
* Srinivasa Ramanujan, "Highly Composite Numbers", Proc. London Math. Soc. 14, 347-407, 1915; reprinted in "Collected Papers" (Ed. G. H. Hardy et al), New York: Chelsea, pp. 78-129, 1962
*
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
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
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
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
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
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
360 (number) — This article is about the number. For the year in the 4th century, see 360. For other uses, see 360 (disambiguation). ← 359 361 → 360 List of numbers Integers … Wikipedia
