62208000

Appears in sequences

• a(n) = n!*((n+1)!)^2.at n=5A224900
• Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3.at n=16A264557
• a(n) = phi(5^n-1), where phi is Euler's totient function (A000010).at n=11A295502
• Numbers k such that phi^e(k) > phi^e(m) for all m < k, where phi^e(k) = A072911(k) is the number of divisors d of k such that d and k are exponentially coprime.at n=14A307004
• Exponentially-odd coreful highly composite numbers: numbers with record values of the number of exponentially odd coreful divisors (A325837).at n=19A325839
• Numbers at which the sum of the iterated exponential totient function (A331273) attains a record.at n=14A331407
• Numbers with a record number of divisors that are both coreful and bi-unitary.at n=18A363333
• Numbers k in A376936 that set records in A379552.at n=17A379553