Highly composite number

__NOTOC__ A highly composite number is a positive integer which has more divisors than any positive integer below it. (There is a second use of the term; see the section below.)

The first twenty-one highly composite numbers are:

	1,	2,	4,	6,	12,	24,	36,	48,	60,	120,	180,	240,	360,	720,	840,	1260,	1680,	2520,	5040,	7560,	and	10080.	,
with:	1,	2,	3,	4,	6,	8,	9,	10,	12,	16,	18,	20,	24,	30,	32,	36,	40,	48,	60,	64,	and	72	positive divisors, respectively
																							.

The sequence of highly composite numbers is a subset of the sequence of smallest numbers k with exactly n divisors .

There are an infinite number of highly composite numbers. To prove this fact, suppose that n is an arbitrary highly composite number. Then 2n has more divisors than n (2n is a divisor and so are all the divisors of n) and so some number larger than n (and not larger than 2n) must be highly composite as well.

Roughly speaking, for a number to be a highly composite it has to have prime factors as small as possible, but not too many of the same. If we decompose a number n in prime factors like this:

n = p_1^{c_1} \times p_2^{c_2} \times \cdots \times p_k^{c_k}

(1)

where $p_1 < p_2 < \cdots < p_k$ are prime, and the exponents $c_i$ are positive integers, then the number of divisors of n is exactly

(c_1 + 1) \times (c_2 + 1) \times \cdots \times (c_k + 1)

. (2)

Hence, for n to be a highly composite number,

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 4 divisors);

the sequence of exponents must be non-increasing, that is $c_1 \geq c_2 \geq \cdots \geq c_k$ ; otherwise, by exchanging two faulty 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 6 divisors).

Also, except in two special cases n = 4 and n = 36, the last exponent c_k must equal 1. Saying that the sequence of exponents is non-increasing is equivalent to saying that a highly composite number is a product of primorials.

Highly composite numbers higher than 6 are also abundant numbers. One need only look at the three or four highest divisors of a particular highly composite number to ascertain this fact. All highly composite numbers are also Harshad numbers.

Many of these numbers are used in traditional systems of measurement, and tend to be used in engineering designs, due to their ease of use in calculations involving vulgar fractions.

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

(ln x)^a ≤ Q(x) ≤ (ln x)^b.

with the first part of the inequality proved by Paul Erdős in 1944 and the second part by J.-L. Nicholas in 1988.

Example

The highly composite number : 10080. 10080 = (2 × 2 × 2 × 2 × 2) × (3 × 3) × 5 × 7 By (2) above, 10080 has exactly seventy-two divisors.

1 × '''10080	2 × ''' 5040	3 × 3360	4 × ''' 2520	5 × 2016	6 × ''' 1680
7 × 1440	8 × ''' 1260	9 × 1120	10 × 1008	12 × ''' 840	14 × ''' 720
15 × 672	16 × 630	18 × 560	20 × 504	21 × 480	24 × 420
28 × ''' 360	30 × 336	32 × 312	35 × 288	36 × 280	40 × 252
42 × ''' 240	45 × 224	48 × 210	56 × ''' 180	60 × 168	63 × 160
70 × 144	72 × 140	80 × 126	84 × ''' 120	90 × 112	96 × 105

Note: The bolded numbers are themself highly composite numbers.
Only the twentieth highly composite number 7560 (=3×2520) is absent.

10080 is a so-called 7-smooth number, .

Second definition

There is a second use of the term highly composite number, defined as a number with all prime divisors ≤ 7. The first few terms are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, and 27 . These are also called 7-smooth numbers; see Smooth number for a generalization and applications.

One interesting characteristic of the HCNs is that quite often there is a prime number immediately adjacent. Number 120 is the first without an adjacent prime number. In addition, a conjecture says the distance from a HCN to the nearest prime when >1 will itself be a prime number distance must always be odd due to involving an odd and even number.

External links

Integer sequences

Example

Second definition

Related

See also

External links

Gourt Home::Gourt :: Highly composite number

Example

Second definition

Related

See also

External links