98999

Properties

Appears in sequences

• Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=38A005520
• Primes that contain digits 8 and 9 only.at n=5A020472
• Numbers having four 9's in base 10.at n=17A043528
• 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=17A059498
• Primes at which sum of digits strictly increases.at n=26A061248
• Smallest prime with digit sum n, or 0 if no such prime exists.at n=43A067180
• The smallest prime with a possible given digit sum.at n=29A067523
• Smallest n-digit prime with maximum digit sum.at n=4A069661
• Smallest prime whose digital sum is equal to the n-th composite number, or 0 if no such prime exists.at n=28A073867
• a(1) = 1, then add, multiply and subtract 2, 3, 4; 5, 6, 7; ... in that order.at n=15A077383
• Near-repdigit primes with 9 as repeated digit.at n=18A105975
• Primes with digit sum = 44.at n=0A106776
• Smallest prime whose digital sum is equal to the n-th composite number not congruent to 0 (modulo 3).at n=15A111380
• Emirps with only composite digits (i.e., 4, 6, 8, 9).at n=2A128389
• Least number k such that A070635(k) = n.at n=43A138791
• Least prime, p, such that p mod (sum of the digits of p) = n.at n=43A138792
• a(n) = largest n-digit prime p whose reversal is a prime q > p.at n=3A152034
• Least prime p with digit sum A047235(n).at n=14A152652
• Primes containing 999 as a substring.at n=28A167292
• Near-repdigit emirps.at n=22A173594