A highly composite number is a positive integer that has more divisors than any smaller positive integer. If d(n) denotes the number of divisors of n, a positive integer N is highly composite when d(N) is greater than d(n) for every n less than N. For example, 6 is highly composite because it has 4 divisors, more than any of 1 through 5. The first two highly composite numbers, 1 and 2, are not themselves composite numbers, though every highly composite number after them is. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Origin YearRamanujan wrote a paper on highly composite numbers in 1915 Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Highly Composite Number (Wikipedia)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.