Nepedia
Back to Discover
Advanced Reader
🔢

Highly composite number

math Maturity 7-9 Next article →

A highly composite number is a positive integer that possesses more divisors than any smaller positive integer. In mathematics, a divisor is a number that divides into another number perfectly, without leaving a remainder. We use the notation d(n) to represent the number of divisors for any integer n. For a number N to be considered highly composite, the value of d(N) must be strictly greater than d(n) for every n that is less than N. This makes these numbers champions of divisibility. They are much more flexible for splitting into equal groups than the numbers surrounding them.

To understand the mechanism, consider the number 6. The divisors of 6 are 1, 2, 3, and 6, so d(6) equals 4. If we check the numbers before it, we find that 1 has one divisor, 2 has two, 3 has two, 4 has three, and 5 has two. Since 4 is greater than all those previous counts, 6 is highly composite.

Highly composite number Cuisenaire rods 6
Highly composite number Cuisenaire rods 6

A related but slightly different concept is the largely composite number. A largely composite number has at least as many divisors as all smaller positive integers. While highly composite numbers must strictly beat the previous record, largely composite numbers only need to match it.

Highly composite numbers follow very specific structural rules regarding their prime factorization. Every positive integer has a unique prime factorization, which is a way of writing a number as a product of prime numbers. For a number to be highly composite, it must use the smallest prime numbers first, such as 2, 3, 5, and so on. If a number skipped a small prime to use a larger one, we could create a smaller number with the same number of divisors. Furthermore, the exponents of these primes must be non-increasing. This means the exponent for 2 must be greater than or equal to the exponent for 3, and so on.

There are also specific rules for the final exponents in the sequence. Except in the special cases of 4 and 36, the last exponent in the prime factorization must equal 1. This rule ensures the number stays as small as possible while maximizing its divisors. Because of these requirements, 1, 4, and 36 are the only highly composite numbers that are also square numbers. These patterns show that highly composite numbers are built by balancing many small prime factors rather than using a few large ones. This balance is what allows them to reach such high divisor counts so quickly.

History shows that humans have been interested in these numbers for a very long time. The mathematician Srinivasa Ramanujan published a significant paper on highly composite numbers in 1915. His work helped formalize our understanding of how these numbers behave. Long before modern calculus, the philosopher Plato may have used them. The mathematician Jean-Pierre Kahane suggested that Plato chose the number 5040 as the ideal number of citizens for a city in his work, "Laws." The number 5040 is highly composite and has exactly 60 divisors, making it very easy to divide into many different group sizes.

We can see the incredible scale of these numbers by looking at specific examples. The first few are 1, 2, 4, 6, and 12. As we progress, the numbers grow rapidly. The number 10080 is a highly composite number with 72 divisors. This means there are 36 different ways to write 10080 as a product of two integers. Some of these pairs include 10 times 1008 or 90 times 112. Some highly composite numbers are even more special and are called superior highly composite numbers. Ten of the first 38 highly composite numbers fall into this elite category.

These numbers have deep connections to other mathematical systems and practical applications. Because they are so easy to divide, they are often used in engineering designs and traditional measurement systems. They help people work with fractions more easily in complex calculations. Every highly composite number is also a practical number because its prime factorization uses all the first k primes. They also relate to abundant numbers; every highly composite number greater than 6 is an abundant number. This means the sum of their proper divisors is greater than the number itself.

706 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (1)
File:Highly composite number Cuisenaire rods 6.png
Highly composite number Cuisenaire rods 6.png
More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.