10000019

Properties

Appears in sequences

• Smallest n-digit prime.at n=7A003617
• Smallest prime in which the n-th significant digit is a 1.at n=7A069588
• Smallest prime in which the n-th significant digit is a 0.at n=5A069597
• Smallest and largest primes pairwise displayed with k digits from k=2,3,... with repeated decimal digits.at n=12A099630
• Smallest and largest of the n-digit primes.at n=14A101592
• Primes at Levenshtein distance n from previous value when considered as a decimal string.at n=8A109809
• Least n-digit prime whose digit permutations yield at least n distinct primes, or 0 if no such prime exists.at n=7A113598
• Primes p+10^n arising in A127003.at n=7A127004
• Smallest prime with number of digits equal to n-th Fibonacci number.at n=4A130150
• The next prime greater than the square root of 10^n.at n=14A131581
• Array read by rows: row n lists the first two primes with n digits.at n=14A139052
• Array read by rows: row n lists the first 3 primes with n digits.at n=21A139053
• Array read by rows: row n lists the first 4 primes with n digits.at n=28A139054
• Smallest prime with 2^n digits.at n=3A157033
• a(n) = smallest prime >= 10^n with primitive root 10.at n=7A205989
• Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).at n=34A213305
• Least n-digit prime whose digit sum is also prime.at n=7A249447
• Successive primes building the lexicographically earliest k X k 'Futility Squares' (see the Comment and Example sections for more explanations).at n=28A368051
• Table T(n,k), 0 < n and 0 <= k < n, where the n-th row contains the smallest n-digit primes that remain prime even if any k of their digits are deleted, or -1 if no such prime exists.at n=25A378697
• The smallest n-digit prime that turns composite at each step as its digits are successively appended, starting from the first.at n=7A382899