128501493120
domain: N
Appears in sequences
- Smallest number with 2^n divisors.at n=12A037992
- 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=22A066616
- 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=23A066616
- a(n) = n*lcm{1,2,...,n}.at n=23A081528
- Smallest highly composite number(A002182) with n digits.at n=11A120585
- a(n) is the largest highly composite number (definition 1) not a multiple of n.at n=23A134592
- Highly composite numbers (A002182) containing equal number of odd and even digits.at n=6A144973
- Earliest sequence such that xy | a(x+y) for all x>=1, y>=1.at n=23A169900
- Least number k such that tau(tau(k)) = n.at n=12A193987
- Bi-unitary highly composite numbers: where the number of bi-unitary divisors of n (A286324) increases to a record.at n=29A293185
- 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=22A306585
- 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=22A340516
- 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=23A340516
- Smallest number with at least 2^n divisors.at n=12A347064
- Highly composite numbers (A002182) whose number of divisors is not a multiple of 3.at n=30A354216
- Numbers that have a record number of infinitary divisors that are exponentially odd numbers (A268335).at n=31A377710