598999

Properties

Appears in sequences

• a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any larger digit.at n=19A059498
• Primes at which sum of digits strictly increases.at n=29A061248
• Smallest prime with digit sum n, or 0 if no such prime exists.at n=48A067180
• The smallest prime with a possible given digit sum.at n=32A067523
• Smallest prime whose digital sum is equal to the n-th composite number, or 0 if no such prime exists.at n=32A073867
• Primes with digit sum = 49.at n=0A106779
• Smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3).at n=17A111380
• a(n) is the smallest prime number, with sum of digits equals n and a(n) is greater than previous nonzero terms, except if this is not possible in which case a(n)=0.at n=48A282342
• a(n) is the first member of A106843 with sum of digits n.at n=47A361831
• Primes having only {5, 8, 9} as digits.at n=33A385798
• Prime numbersat n=49025