13967553600
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=15A002201
- "Second order" highly composite numbers: the gap between the number of divisors (d(n)) rises to a new record.at n=11A095717
- Numbers n such that n, 2n, 3n are all highly composite numbers.at n=26A143770
- Highly composite numbers (A002182) whose following highly composite number is at least 3/2 times greater.at n=28A162936
- 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=16A263572
- Superior highly composite numbers that are superabundant but not colossally abundant.at n=0A304234
- Least number that can be written as a multinomial coefficient in exactly n ways, or 0 if no such number exists.at n=12A376376
- Indices of records in A376369.at n=7A376378
- The smallest of the most common numbers among the multinomial coefficients n!/(x_1! * ... * x_k!) for all partitions (x_1, ..., x_k) of n.at n=20A376662
- Square array read by antidiagonals: row n lists numbers whose maximal frequency in a fixed row of A036038 (or A078760) is equal to n, i.e., numbers m such that A376663(m) = n.at n=26A376667