5587021440

Appears in sequences

• Smallest number with 2^n divisors.at n=11A037992
• a(n) = (4*n+10)(!^4)/10(!^4), related to A000407 ((4*n+2)(!^4) quartic, or 4-factorials).at n=7A051622
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=18A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=19A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=20A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=21A066616
• Smallest highly composite number of the form k*a(n-1) where k is an integer greater than 1.at n=16A133411
• Largest highly composite number <= 2*a(n-1).at n=36A135614
• Bi-unitary superabundant numbers: numbers n such that bsigma(n)/n > bsigma(m)/m for all m < n, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=21A292984
• Bi-unitary highly composite numbers: where the number of bi-unitary divisors of n (A286324) increases to a record.at n=25A293185
• Start with n and find the LCM of n and A140635(n), and continue until a number m is reached such that A140635(m) = m.at n=18A306585
• Start with n and find the LCM of n and A140635(n), and continue until a number m is reached such that A140635(m) = m.at n=37A306585
• Highly composite numbers (A002182) that are not superabundant numbers (A004394).at n=21A308913
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=18A340516
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=19A340516
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=20A340516
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=21A340516
• Smallest number with at least 2^n divisors.at n=11A347064
• Nonexponential superabundant numbers: numbers m such that nesigma(m)/m > nesigma(k)/k for all k < m, where nesigma(m) is the sum of nonexponential divisors of m (A160135).at n=26A348630
• a(n) = (4*n)! / (n! * (2*n)!).at n=5A349468