77175

Appears in sequences

• Smallest number that is n times the product of its digits or 0 if impossible.at n=44A056770
• Numbers k such that both k and k+1 are abundant.at n=17A096399
• Numbers k such that both sigma(k) >= 2*k-1 and sigma(k+1) >= 2*(k+1)-1.at n=19A103289
• 7-smooth numbers containing only noncomposite digits (1,2,3,5,7).at n=45A113623
• Sum of proper divisors of the number of partitions of n.at n=47A139055
• Numbers with exactly 3 distinct odd prime divisors {3,5,7}.at n=34A147576
• Numbers of the form p^3*q^2*r^2 where p, q, and r are distinct primes.at n=31A179695
• Positive integers, c, such that there are more than two solutions to the equation a^2 + b^3 = c^4, with a, b > 0.at n=44A242381
• Number of surviving (but not bifurcating) odd nodes at generation n in the binary tree of persistently squarefree numbers (see A293230).at n=43A293519
• Numbers m such that sigma(sigma(m))/m is a square.at n=37A318084
• Numbers k such that both k and k+1 are Zumkeller numbers (A083207).at n=15A328327
• Odd numbers that are divisible by the product of their digits.at n=42A342949
• Zuckerman numbers which when divided by the product of their digits, give a quotient which is a Niven (Harshad) number.at n=48A343682
• Numbers of multiplicative persistence 4 which are themselves the product of digits of a number.at n=24A350183
• Numbers whose k-th arithmetic derivative is zero for some k>0, ordered by their position in A276086.at n=44A351255
• Triangle read by rows. Let R(n, k) = Y(n, k, B) where Y are the partial Bell polynomials and B is the list [Bernoulli(j, 1), j = 0..n]. T(n, k) are R(n, k) normalized by the lcm of the denominators of the terms in row n (A048803).at n=32A352372
• Numbers k such that k and k+1 are both S-abundant numbers (A181487).at n=5A364861
• Numbers having a self-conjugate multiplicative partition into primes.at n=14A378633
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -4.at n=13A380925