100043

Properties

Appears in sequences

• Triangle read by rows in which row n gives n smallest n-digit primes.at n=17A073914
• Smallest prime of the form 10^k + prime(n), k >= d, the number of digits in prime(n). 0 if no such primes exist. a(n) = 0 if prime(n) + 1 == 0 (mod 3).at n=13A114782
• Prime numbers that are the sum of the cubes of three distinct primes with the same final digit.at n=1A126708
• Array read by rows: row n lists the first 3 primes with n digits.at n=17A139053
• Array read by rows: row n lists the first 4 primes with n digits.at n=22A139054
• The larger member of a prime pair (p,p+100000).at n=2A165297
• Incorrect duplicate of A062343.at n=37A176254
• Primes less than 1000000 sorted lexicographically in decimal representation.at n=2A210761
• Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).at n=18A213305
• Primes p with prime(p)^3 + 2*p^3 and p^3 + 2*prime(p)^3 both prime.at n=31A236574
• SanD primes with d = 14: p and p+d are both prime and digit sum A007953(p*(p+d)) = d.at n=16A307471
• Let u defined by u(1) = p and for 1 < i, u(i) = u(i-1) + primorial(i), such that all u(i) are primes for 1 <= i <= k, and u(k+1) is not prime. Let m the length of the longest run of primes obtained when u is repeatedly applied to an n-digit p. Triangle read by rows: for 1 <= n, 1 <= k <= m, T(n,k) is the least n-digit prime p beginning a run of only k primes when applied u, or -1 if no such prime p exists.at n=42A356732
• The smallest n-digit prime that turns composite at each step as its digits are successively appended, starting from the last.at n=5A382981
• Primes containing 000 as a substring.at n=10A386247
• Prime numbersat n=9595