Highly Composite Number — Definition, Formula & Examples
A highly composite number is a positive integer that has more divisors than every positive integer smaller than it. For example, 12 is highly composite because no number from 1 to 11 has as many divisors as 12 does.
A positive integer is called highly composite if for all positive integers , where denotes the number of positive divisors of .
How It Works
To check whether a number is highly composite, count its divisors and compare that count to the divisor counts of every smaller positive integer. If the number sets a new record — strictly more divisors than any predecessor — it qualifies. The first several highly composite numbers are 1, 2, 4, 6, 12, 24, 36, 48, 60, 120. Notice these numbers tend to have many small prime factors; they are built to be maximally divisible for their size.
Worked Example
Problem: Verify that 12 is a highly composite number.
Step 1: List the divisors of 12.
Step 2: Find the divisor count for every positive integer less than 12 and identify the maximum.
Step 3: Compare. The highest divisor count below 12 is 4 (achieved by 6, 8, and 10). Since 6 > 4, the number 12 beats every predecessor.
Answer: 12 is a highly composite number because its 6 divisors exceed the divisor count of every smaller positive integer.
Visualization
Why It Matters
Highly composite numbers appear naturally when you need efficient divisibility — for instance, ancient civilizations chose bases like 12 and 60 for counting and timekeeping precisely because they have many divisors. In competition mathematics and cryptography, understanding how divisor counts grow helps with problems involving factorization and modular arithmetic.
Common Mistakes
Mistake: Confusing highly composite numbers with numbers that simply have "a lot" of divisors.
Correction: The definition requires a strict record: must be greater than for every , not just large in general. For example, 18 has 6 divisors, but so does 12, which is smaller — so 18 is not highly composite.