42999

Appears in sequences

• Smallest multiple of n whose digits sum to n.at n=33A002998
• Smallest proper multiple of n with digit sum n.at n=32A069035
• Smallest multiple of n with two or more digits, none of them zeros, whose digit sum equals n, or 0 if no such multiple exists.at n=32A077754
• a(n) is the smallest number which is divisible by n, is not equal to n and its digital sum is also divisible by n.at n=32A163502
• The number of solutions to phi(x) = phi(x+1) below 10^n, where phi(x) is the Euler totient function.at n=14A300285
• Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k and with sum of digits of k = n, or 0 if no such k exists.at n=32A333666