4999999

Properties

Appears in sequences

• Primes that contain digits 4 and 9 only.at n=17A020466
• 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=24A059498
• Primes at which sum of digits strictly increases.at n=35A061248
• Smallest prime with digit sum n, or 0 if no such prime exists.at n=57A067180
• The smallest prime with a possible given digit sum.at n=38A067523
• Smaller of two consecutive primes which have no common digits.at n=26A068803
• Smallest prime whose digital sum is equal to the n-th composite number, or 0 if no such prime exists.at n=40A073867
• Numbers n such that all the divisors of n appear as substrings in n^3.at n=15A074493
• Primes of the form 2^r*5^s - 1.at n=29A077313
• Primes of the form identical digits preceded by a 4.at n=9A090152
• Primes of the form 5*10^n - 1.at n=3A093945
• Numbers n such that n concatenated with n+1 is triangular.at n=25A094609
• Near-repdigit primes with 9 as repeated digit.at n=33A105975
• Primes with digit sum = 58.at n=0A106785
• Smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3).at n=22A111380
• Smallest prime of the form 4 followed by n copies of k.at n=5A112748
• n is prime and digits of n^3 include digits of n as substring.at n=12A115739
• Numbers m such that m + sigma(m) is a repdigit.at n=27A116017
• Smallest number whose sum of digits is 3n+1.at n=19A133264
• Smallest number whose sum of digits is 2n.at n=29A133296