367567200

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=13A002201
• 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=13A004490
• a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1).at n=33A019505
• Least common multiple of the first n composite numbers.at n=22A025543
• Least common multiple of the first n composite numbers.at n=23A025543
• Least common multiple of the first n composite numbers.at n=24A025543
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=29A036484
• Distinct values arising in the sequence of the least common multiples of the first n composite numbers.at n=13A064354
• LCM of the composite numbers between n and 2n (both inclusive).at n=16A073841
• LCM of the composite numbers between n and 2n (both inclusive).at n=17A073841
• "Second order" highly composite numbers: the gap between the number of divisors (d(n)) rises to a new record.at n=9A095717
• Least colossally abundant number c with sigma(c)/c >= n.at n=3A110442
• Largest highly composite number <= 2*a(n-1).at n=32A135614
• a(n) is the smallest number with same number of divisors as n*a(n-1).at n=12A138113
• Duplicate of A073841.at n=15A140813
• Duplicate of A073841.at n=16A140813
• Numbers n such that n, 2n, 3n are all highly composite numbers.at n=21A143770
• A product of quotients of factorials.at n=16A161887
• Highly composite numbers (A002182) whose following highly composite number is at least 3/2 times greater.at n=24A162936
• a(n) = h(1)*h(2)*...*h(n), where h(i) = i/[g(i/2)*g(i/4)*g(i/8)*...] and g(x) = x if x is an integer and g(x) = 1 otherwise.at n=18A185021