PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Low Entry average rating: No information on entry rating
highly composite number (Definition)

We call $n$ a highly composite number if $d(n)>d(m)$ for all $m<n$ where $d(n)$ is the number of divisors of $n$ The first several are 1, 2, 4, 6, 12, 24. The sequence is A002182 in Sloane's OEIS.

The integer $n$ is superior highly composite if there is an $\epsilon>0$ such that for all $m\not=n$ $$d(n) n^{-\epsilon} > d(m) m^{-\epsilon}.$$ The first several superior highly composite numbers are 2, 6, 12, 60, 120, 360. The sequence is A002201 in Sloane's encyclopedia.

Bibliography

1
L. Alaoglu and P. Erdös, On highly composite and similar numbers. Trans. Amer. Math. Soc. 56 (1944), 448-469. Available at www.jstor.org




"highly composite number" is owned by Kevin OBryant.
(view preamble | get metadata)

View style:

Also defines:  superior highly composite number

Attachments:
list of divisors of some small highly composite numbers (Example) by PrimeFan
prime factorizations of some small highly composite numbers (Example) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: composite, integer, OEIS, sequence, divisors, number
There are 7 references to this entry.

This is version 4 of highly composite number, born on 2003-06-11, modified 2006-12-08.
Object id is 4347, canonical name is HighlyCompositeNumber.
Accessed 10717 times total.

Classification:
AMS MSC11N56 (Number theory :: Multiplicative number theory :: Rate of growth of arithmetic functions)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)