343978

Appears in sequences

• Smallest multiple of n beginning with n and having a digit sum n, or 0 if no such number exists.at n=33A077727
• Numbers k for which phi(A267099(k)) is equal to phi(k), but the number of 4m+1 and 4m+3 primes in the prime factorization of k (when counted with multiplicity) is not equal. Here A267099 is fully multiplicative involution swapping the positions of 4m+1 and 4m+3 primes, and phi is Euler totient function.at n=28A354194