1000099

Properties

Appears in sequences

• Triangle read by rows in which row n gives n smallest n-digit primes.at n=26A073914
• Primes of the form 10^n + 10^(n-4) - 1.at n=0A096212
• First prime in primes of the form 10^n + 10^(n-k) - 1.at n=3A096214
• Primes of the form ((p+1)/2)^3 + ((p-1)/2), p is prime.at n=14A163426
• Naughty primes: primes in which the number of zeros is greater than the number of all other digits.at n=22A164968
• Primes of the form n^3 + n - 1.at n=26A182332
• Least prime having 1 more digit and higher sum of digits than the preceding term.at n=6A199124
• Primes of the form m = 10^i + 10^j - 1, where i > j >= 0.at n=5A239720
• Primes of the form 10^i + 10^j - 1.at n=9A306855
• a(n) is the least prime p such that {p, p^2, ..., p^n} are all digitally balanced numbers in base 2 (A031443).at n=4A345396
• Successive primes building the lexicographically earliest k X k 'Futility Squares' (see the Comment and Example sections for more explanations).at n=24A368051
• Smallest prime such that the number of distinct prime factors of its 9's complement is equal to n. If no such number exists return -1.at n=5A377471
• Prime numbersat n=78504