98933

Appears in sequences

• Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=22A074348
• Numbers k such that k and k^2 use only the digits 3, 4, 7, 8 and 9.at n=7A137130