1000039

Properties

Appears in sequences

• Triangle read by rows in which row n gives n smallest n-digit primes.at n=24A073914
• For any prime p, define a sequence S_p: S_p(1) = p and S_p(n+1) is the least prime > S_p(n) that begins with the last digit of S_p(n). Let f(p) be the first member of S_p that is the digit reversal of the previous member. Sequence contains primes p that such that f(p) does not equal f(q) for any q < p.at n=10A089592
• Array read by rows: row n lists the first 4 primes with n digits.at n=27A139054
• Naughty primes: primes in which the number of zeros is greater than the number of all other digits.at n=20A164968
• Least n-digit emirp (A006567) with emirp digital sum, or 0 if no such value.at n=6A167992
• Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).at n=25A213305
• Prime numbersat n=78502