4655851200

Appears in sequences

• Highly composite numbers k such that 2*k is not a highly composite number.at n=26A073771
• a(n) = n*lcm{1,2,...,n}.at n=19A081528
• Smallest number of the form n*k + 1 that is divisible by all the phi(n) numbers less than n and relatively prime to n.at n=21A084715
• a(n) is the largest highly composite number (definition 1) not a multiple of n.at n=25A134592
• a(n) is the smallest number with same number of divisors as n*a(n-1).at n=13A138113
• Earliest sequence such that xy | a(x+y) for all x>=1, y>=1.at n=19A169900
• Earliest sequence such that xy | a(x+y) and (x+y) | a(xy) for all x >= 1, y >= 1.at n=19A169902
• a(n) = (A099795(n)^-1 mod p)*A099795(n), where p = prime(n).at n=8A254939
• Highly composite numbers (A002182) that are not superabundant numbers (A004394).at n=20A308913
• Recursive highly composite numbers: numbers with a record number of recursive divisors (A282446).at n=35A333931
• 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=25A376667
• Positive integers whose maximum frequency in a fixed row of A036038 (or A078760) is equal to 5, i.e., numbers m such that A376663(m) = 5.at n=2A376672