45579

Appears in sequences

• a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=41A064022
• Numbers of the form a^2 + b^3 equal to 1-almost-prime(m) + 2-almost-prime(m) + 2-almost-prime(n) + k-almost-prime(n).at n=9A113915