Highly Composite Number Checker

About this calculator

A highly composite number is a positive integer that has more divisors than any smaller positive integer — a concept formally studied by Srinivasa Ramanujan in a landmark 1915 paper. For example, 12 is highly composite because it has 6 divisors (1, 2, 3, 4, 6, 12), more than any integer below it, while 10 is not, since 8 already has 4 divisors, matching 10's own count without beating it. The sequence starts 1, 2, 4, 6, 12, 24, 36, 48, 60, 120... and grows increasingly sparse.

These numbers are of interest in number theory research, recreational mathematics, and combinatorics, and they show up practically wherever a number with many factors is useful — historically, 12, 24, 60, and 360 (all highly composite or closely related) were chosen for hours in a day, minutes in an hour, and degrees in a circle precisely because they divide evenly by so many small numbers.

This checker takes a positive integer, counts its divisors, and compares that count against every smaller integer to determine whether it qualifies as highly composite — useful for students exploring number theory and math enthusiasts verifying sequences from Ramanujan's original work or OEIS.