Highly composite number

A highly composite number is a positive integer that has more divisors than all smaller positive integers. If d(n) denotes the number of divisors of a positive integer n, then a positive integer N is highly composite if d(N) > d(n) for all n < N. For example, 6 is highly composite because d(6) = 4, and for n = 1,2,3,4,5, you get d(n) = 1,2,2,3,2, respectively, which are all less than 4.

A related concept is that of a largely composite number, a positive integer that has at least as many divisors as all smaller positive integers. The name can be somewhat misleading, as the first two highly composite numbers (1 and 2) are not actually composite numbers; however, all further terms are.

Ramanujan wrote a paper on highly composite numbers in 1915.^[1]

The mathematician Jean-Pierre Kahane suggested that Plato must have known about highly composite numbers as he deliberately chose such a number, 5040 (= 7!), as the ideal number of citizens in a city.^[2] Furthermore, Vardoulakis and Pugh's paper delves into a similar inquiry concerning the number 5040.^[3]

The first 41 highly composite numbers are listed in the table below (sequence A002182 in the OEIS). The number of divisors is given in the column labeled d(n). Asterisks indicate superior highly composite numbers.

The divisors of the first 20 highly composite numbers are shown below.

The table below shows all 72 divisors of 10080 by writing it as a product of two numbers in 36 different ways.

The 15,000th highly composite number can be found on Achim Flammenkamp's website. It is the product of 230 primes:

${\displaystyle a_{0}^{14}a_{1}^{9}a_{2}^{6}a_{3}^{4}a_{4}^{4}a_{5}^{3}a_{6}^{3}a_{7}^{3}a_{8}^{2}a_{9}^{2}a_{10}^{2}a_{11}^{2}a_{12}^{2}a_{13}^{2}a_{14}^{2}a_{15}^{2}a_{16}^{2}a_{17}^{2}a_{18}^{2}a_{19}a_{20}a_{21}\cdots a_{229},}${\displaystyle a_{0}^{14}a_{1}^{9}a_{2}^{6}a_{3}^{4}a_{4}^{4}a_{5}^{3}a_{6}^{3}a_{7}^{3}a_{8}^{2}a_{9}^{2}a_{10}^{2}a_{11}^{2}a_{12}^{2}a_{13}^{2}a_{14}^{2}a_{15}^{2}a_{16}^{2}a_{17}^{2}a_{18}^{2}a_{19}a_{20}a_{21}\cdots a_{229},}

where ${\displaystyle a_{n}}${\displaystyle a_{n}} is the ${\displaystyle n}${\displaystyle n}th successive prime number, and all omitted terms (a₂₂ to a₂₂₈) are factors with exponent equal to one (i.e. the number is ${\displaystyle 2^{14}\times 3^{9}\times 5^{6}\times \cdots \times 1451}${\displaystyle 2^{14}\times 3^{9}\times 5^{6}\times \cdots \times 1451}). More concisely, it is the product of seven distinct primorials:

${\displaystyle b_{0}^{5}b_{1}^{3}b_{2}^{2}b_{4}b_{7}b_{18}b_{229},}${\displaystyle b_{0}^{5}b_{1}^{3}b_{2}^{2}b_{4}b_{7}b_{18}b_{229},}

where ${\displaystyle b_{n}}${\displaystyle b_{n}} is the primorial ${\displaystyle a_{0}a_{1}\cdots a_{n}}${\displaystyle a_{0}a_{1}\cdots a_{n}}.^[4]

Roughly speaking, for a number to be highly composite it has to have prime factors as small as possible, but not too many of the same. By the fundamental theorem of arithmetic, every positive integer n has a unique prime factorization:

${\displaystyle n=p_{1}^{c_{1}}\times p_{2}^{c_{2}}\times \cdots \times p_{k}^{c_{k}}}${\displaystyle n=p_{1}^{c_{1}}\times p_{2}^{c_{2}}\times \cdots \times p_{k}^{c_{k}}}

where ${\displaystyle p_{1}<p_{2}<\cdots <p_{k}}${\displaystyle p_{1}<p_{2}<\cdots <p_{k}} are prime, and the exponents ${\displaystyle c_{i}}${\displaystyle c_{i}} are positive integers.

Any factor of n must have the same or lesser multiplicity in each prime:

${\displaystyle p_{1}^{d_{1}}\times p_{2}^{d_{2}}\times \cdots \times p_{k}^{d_{k}},0\leq d_{i}\leq c_{i},0<i\leq k}${\displaystyle p_{1}^{d_{1}}\times p_{2}^{d_{2}}\times \cdots \times p_{k}^{d_{k}},0\leq d_{i}\leq c_{i},0<i\leq k}

So the number of divisors of n is:

${\displaystyle d(n)=(c_{1}+1)\times (c_{2}+1)\times \cdots \times (c_{k}+1).}${\displaystyle d(n)=(c_{1}+1)\times (c_{2}+1)\times \cdots \times (c_{k}+1).}

Hence, for a highly composite number n,

• the k given prime numbers p_i must be precisely the first k prime numbers (2, 3, 5, ...); if not, we could replace one of the given primes by a smaller prime, and thus obtain a smaller number than n with the same number of divisors (for instance 10 = 2 × 5 may be replaced with 6 = 2 × 3; both have four divisors);
• the sequence of exponents must be non-increasing, that is ${\displaystyle c_{1}\geq c_{2}\geq \cdots \geq c_{k}}${\displaystyle c_{1}\geq c_{2}\geq \cdots \geq c_{k}}; otherwise, by exchanging two exponents we would again get a smaller number than n with the same number of divisors (for instance 18 = 2¹×ばつ 3² may be replaced with 12 = 2²×ばつ 3¹; both have six divisors).

Also, except in two special cases n = 4 and n = 36, the last exponent c_k must equal 1. It means that 1, 4, and 36 are the only square highly composite numbers. Saying that the sequence of exponents is non-increasing is equivalent to saying that a highly composite number is a product of primorials or, alternatively, the smallest number for its prime signature.

Note that although the above described conditions are necessary, they are not sufficient for a number to be highly composite. For example, 96 = 2⁵ ×ばつ 3 satisfies the above conditions and has 12 divisors but is not highly composite since there is a smaller number (60) which has the same number of divisors.

If Q(x) denotes the number of highly composite numbers less than or equal to x, then there are two constants a and b, both greater than 1, such that

${\displaystyle (\log x)^{a}\leq Q(x)\leq (\log x)^{b},円.}${\displaystyle (\log x)^{a}\leq Q(x)\leq (\log x)^{b},円.}

The first part of the inequality was proved by Paul Erdős in 1944 and the second part by Jean-Louis Nicolas in 1988. We have

${\displaystyle 1.13862<\liminf _{x,円\to ,円\infty }{\frac {\log Q(x)}{\log \log x}}\leq 1.44\ }${\displaystyle 1.13862<\liminf _{x,円\to ,円\infty }{\frac {\log Q(x)}{\log \log x}}\leq 1.44\ }

and

${\displaystyle \limsup _{x,円\to ,円\infty }{\frac {\log Q(x)}{\log \log x}}\leq 1.71\ .}${\displaystyle \limsup _{x,円\to ,円\infty }{\frac {\log Q(x)}{\log \log x}}\leq 1.71\ .}^[5]

Highly composite numbers greater than 6 are also abundant numbers. One need only look at the three largest proper divisors of a particular highly composite number to ascertain this fact. It is false that all highly composite numbers are also Harshad numbers in base 10. The first highly composite number that is not a Harshad number is 245,044,800; it has a digit sum of 27, which does not divide evenly into 245,044,800.

10 of the first 38 highly composite numbers are superior highly composite numbers. The sequence of highly composite numbers (sequence A002182 in the OEIS) is a subset of the sequence of smallest numbers k with exactly n divisors (sequence A005179 in the OEIS).

Highly composite numbers whose number of divisors is also a highly composite number are

1, 2, 6, 12, 60, 360, 1260, 2520, 5040, 55440, 277200, 720720, 3603600, 61261200, 2205403200, 293318625600, 6746328388800, 195643523275200 (sequence A189394 in the OEIS).

It is extremely likely that this sequence is complete.

A positive integer n is a largely composite number if d(n) ≥ d(m) for all m ≤ n. The counting function Q_L(x) of largely composite numbers satisfies

${\displaystyle (\log x)^{c}\leq \log Q_{L}(x)\leq (\log x)^{d}\ }${\displaystyle (\log x)^{c}\leq \log Q_{L}(x)\leq (\log x)^{d}\ }

for positive c and d with ${\displaystyle 0.2\leq c\leq d\leq 0.5}${\displaystyle 0.2\leq c\leq d\leq 0.5}.^{[6] [7]}

Because the prime factorization of a highly composite number uses all of the first k primes, every highly composite number must be a practical number.^[8] Due to their ease of use in calculations involving fractions, many of these numbers are used in traditional systems of measurement and engineering designs.

• Superior highly composite number
• Highly totient number
• Table of divisors
• Euler's totient function
• Round number
• Smooth number

• Sándor, József; Mitrinović, Dragoslav S.; Crstici, Borislav, eds. (2006). Handbook of number theory I. Dordrecht: Springer-Verlag. pp. 45–46. ISBN 1-4020-4215-9. Zbl 1151.11300.
• Erdös, P. (1944). "On highly composite numbers" (PDF). Journal of the London Mathematical Society . Second Series. 19 (75_Part_3): 130–133. doi:10.1112/jlms/19.75_part_3.130. MR 0013381.
• Alaoglu, L.; Erdös, P. (1944). "On highly composite and similar numbers" (PDF). Transactions of the American Mathematical Society . 56 (3): 448–469. doi:10.2307/1990319. JSTOR 1990319. MR 0011087.
• Ramanujan, Srinivasa (1997). "Highly composite numbers" (PDF). Ramanujan Journal. 1 (2): 119–153. doi:10.1023/A:1009764017495. MR 1606180. S2CID 115619659. Annotated and with a foreword by Jean-Louis Nicolas and Guy Robin.

• Weisstein, Eric W. "Highly Composite Number". MathWorld .
• Algorithm for computing Highly Composite Numbers
• First 10000 Highly Composite Numbers as factors
• Achim Flammenkamp, First 779674 HCN with sigma, tau, factors
• Online Highly Composite Numbers Calculator
• 5040 and other Anti-Prime Numbers - Dr. James Grime by Dr. James Grime for Numberphile

• Integer sequences
• Mathematics-related lists

• CS1 French-language sources (fr)
• Articles with short description
• Short description is different from Wikidata