100049

Properties

Appears in sequences

• Triangle read by rows in which row n gives n smallest n-digit primes.at n=18A073914
• Smallest n-digit prime containing no prime substrings, or 0 if no such number exists.at n=5A089770
• a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=39A096295
• Least n-digit prime whose digit reversal is also prime.at n=5A114018
• Smallest n-digit prime whose reversal is also prime.at n=5A127746
• Array read by rows: row n lists the first 4 primes with n digits.at n=23A139054
• Smallest n-digit emirp with only nonprime digits.at n=3A177850
• a(1) = 1, a(n+1) = least prime p > a(n) such that a(n) + p is a square.at n=32A178825
• Least prime having 1 more digit and higher sum of digits than the preceding term.at n=5A199124
• Primes less than 1000000 sorted lexicographically in decimal representation.at n=3A210761
• Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).at n=20A213305
• Prime numbers p such that all prime factors of p+1 and p-1 are smaller than the cube root of p.at n=35A283791
• Primes p such that A001175(p) = (p-1)/8.at n=34A308793
• Primes using all the square digits {0, 1, 4, 9} and no others.at n=15A331346
• Primes containing 000 as a substring.at n=11A386247
• Prime numbersat n=9596