61261200

Appears in sequences

• Numbers k such that sigma(k)/phi(k) sets a new record.at n=38A018894
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=26A036484
• Least number whose number of divisors is n!.at n=6A061300
• Duplicate of A061300.at n=6A061307
• Least k such that n*prime(k) <= k*tau(k).at n=34A073066
• 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=34A095848
• Numbers j where sigma_k(j) increases to a record for all real values of k.at n=30A095849
• Largest highly composite number <= 2*a(n-1).at n=29A135614
• a(n) is the smallest integer k such that n*k is the smallest multiple of k with twice as many divisors as k, or 0 if no such number is possible.at n=16A139315
• Numbers n such that n, 2n, 3n are all highly composite numbers.at n=18A143770
• Superabundant numbers (A004394) that are not colossally abundant (A004490).at n=27A189228
• Highly composite numbers whose number of divisors is also highly composite.at n=13A189394
• Generalized 2-super abundant numbers.at n=37A208767
• Numbers n such that Sum_{d|n} 1/sigma(d) > Sum_{d|m} 1/sigma(d) for all m < n.at n=45A266228
• Smallest number with same number of divisors as 3*a(n-1).at n=21A307015
• Numbers m such that s(m)/m > s(k)/k for all k < m, where s(m) = A168512(m) is the sum of divisors of m, weighted by divisor multiplicity.at n=40A326807
• Largest highly composite number that has n prime factors counted with multiplicity.at n=12A328522
• Numbers k with a record value of tau(tau(k)) (A010553), where tau(k) is the number of divisors of k (A000005).at n=13A335831
• Numbers in A166981 that are neither superior highly composite nor colossally abundant.at n=27A338786
• Highly composite numbers that are one more than a prime number.at n=23A352634