98899

Properties

Appears in sequences

• Primes that contain digits 8 and 9 only.at n=4A020472
• Primes that remain prime through 4 iterations of function f(x) = 2x + 5.at n=38A023304
• Primes that remain prime through 5 iterations of function f(x) = 2x + 5.at n=8A023332
• a(n) = largest prime using least number of possible digits with a digit sum n, or 0 if no such number exists. E.g., if n > 9 and there are no two-digit primes with a given digit sum n then three-digit numbers are explored and so on.at n=42A088115
• a(n)=numerator of the probability that (x-y)/(x+y)+(y-z)/(y+z)+(z-u)/(z+u)+ (u-x)/(u+x)>0, assuming that each random quadruple of integers (x,y,z,u), with a<=x,y,z,u<=n, is equally likely.at n=35A106199
• Primes with digit sum = 43.at n=3A106775
• Every digit of prime and its index contains a loop (only digits 0,4,6,8,9 in prime and its index).at n=15A107625
• Minimal set of prime-strings in base 10 for primes of the form 4n+3 in the sense of A071062.at n=40A111056
• Least prime, p, such that p mod (sum of the digits of p) = n.at n=42A138792
• In this sequence each prime ends a prime century. Place a 0 between the final two digits, and raise the 100s digit by 1, to form the first prime of the next century.at n=15A156083
• Numbers n whose reversal is a multiple of the reversal of n+1.at n=20A250603
• Primes having only {0, 8, 9} as digits.at n=17A385772
• Primes having only {2, 8, 9} as digits.at n=21A385790
• Primes having only {4, 8, 9} as digits.at n=26A385796
• Primes having only {5, 8, 9} as digits.at n=21A385798
• Primes having only {6, 8, 9} as digits.at n=27A385800
• Prime numbersat n=9494