3603600

Appears in sequences

• Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.at n=33A004394
• Numbers k such that sigma(k)/phi(k) sets a new record.at n=31A018894
• Least common multiple of the first n composite numbers.at n=16A025543
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=22A036484
• Largest number having binary order n (A029837) and of which the number of divisors is maximal in that range of g(k) = n.at n=22A036493
• a(1) = 8; a(n) = least k with d(k) = a(n-1), where d(k) is the number of divisors of k.at n=3A037025
• a(n) = (n+9)!/9!.at n=6A049398
• Generalized Stirling number triangle of first kind.at n=21A051523
• Product of 6 consecutive integers.at n=15A053625
• Numbers k such that sigma(k) - usigma(k) > 3k.at n=20A063875
• Distinct values arising in the sequence of the least common multiples of the first n composite numbers.at n=10A064354
• Least k such that n*prime(k) <= k*tau(k).at n=20A073066
• LCM of the composite numbers between n and 2n (both inclusive).at n=12A073841
• a(n) = smallest (n+1)(n+2)...(n+k) that is >= n!.at n=8A075358
• Numbers k such that sigma(k)/k >= sigma(m)/m for all m <= k.at n=34A077006
• Smallest product (n+1)(n+2)...(n+k) which is a multiple of n, where n+k is given by A061243.at n=8A081470
• Table of graphs with n (>=0) nodes and k (>=0) edges. Each type of object labeled from its own label set.at n=32A091478
• a(n) = (n-1)*(n-2)*...*(n-r) with the least value of r so that n divides a(n).at n=10A092914
• Numbers k such that, for all m < k, d_i(k) <= d_i(m) for i=1 to Min(d(k),d(m)), where d_i(k) denotes the i-th smallest divisor of k.at n=25A094783
• Deeply composite numbers: numbers n where sigma_k(n) increases to a record for all sufficiently low (i.e., negative) values of k.at n=28A095848