321253732800
domain: N
Appears in sequences
- Superior highly composite numbers: positive integers n for which there is an e > 0 such that d(n)/n^e >= d(k)/k^e for all k > 1, where the function d(n) counts the divisors of n (A000005).at n=16A002201
- Colossally abundant numbers: m for which there is a positive exponent epsilon such that sigma(m)/m^{1 + epsilon} >= sigma(k)/k^{1 + epsilon} for all k > 1, so that m attains the maximum value of sigma(m)/m^{1 + epsilon}.at n=16A004490
- Smallest number with same number of divisors as n!.at n=16A045977
- "Second order" highly composite numbers: the gap between the number of divisors (d(n)) rises to a new record.at n=12A095717
- Highly composite numbers (A002182) containing equal number of odd and even digits.at n=7A144973
- Highly composite numbers (A002182) whose following highly composite number is at least 3/2 times greater.at n=31A162936
- Numbers that are superior highly composite and colossally abundant.at n=15A224078
- Numbers n that minimize sigma(n) / (n^(1-delta) d(n)) for some delta > 0, where d = divisor count = A000005, sigma = divisor sum = A000203.at n=17A263572
- (sigma, tau)-superchampion numbers: numbers k for which there is a positive exponent e such that sigma(k)/(k*tau(k)^e) >= sigma(j)/(j*tau(j)^e) for all j >= 1, where tau(k) is the number of divisors of k (A000005) and sigma(k) is their sum (A000203).at n=17A309811
- Denominator of Sum_{k=1..n} 1/(k*(prime(k+1)-prime(k))).at n=27A324801