91770

Appears in sequences

• Products of exactly 6 distinct primes.at n=16A067885
• Numbers with six distinct prime divisors.at n=20A074969
• Partial sums of A084570.at n=37A084569
• Smallest number beginning with 9 that is the product of exactly n distinct primes.at n=5A106419
• a(n) = n*(n + 11)*(n + 22)*(n + 33)/24.at n=24A264448
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=14A285615
• Unitary barely 3-abundant: numbers m such that 3 < usigma(m)/m < usigma(k)/k for all numbers k < m, where usigma is the sum of unitary divisors function (A034448).at n=9A336671
• Numbers k > 2 such that omega(k) > log(log(k)) + 2 * sqrt(log(log(k))), where omega(k) is the number of distinct primes dividing k (A001221).at n=23A336910
• Lexicographically earliest sequence of positive distinct terms such that the digital root of a(n) is the number of distinct prime factors of a(n+1).at n=48A337096
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=14A387153