1000003

Properties

Appears in sequences

• Smallest n-digit prime.at n=6A003617
• Liponombres: numbers whose French name does not contain the letter "e".at n=14A014254
• Smallest prime containing exactly n 0's.at n=5A037053
• Numbers whose square contains the same digit more than 2/3 of the time and does not end in 0.at n=17A039820
• Least n-digit 'happy' prime.at n=6A046519
• Prime liponombres.at n=3A050280
• Start with the prime 11; next prime must exceed previous prime and start with last digit of previous prime.at n=14A054262
• a(1) = 2; a(n+1) = smallest prime > a(n) with leading digit equal to final digit of a(n).at n=14A061448
• Primes whose sum of digits is 4.at n=14A062339
• Smallest prime with prime(n) decimal digits.at n=3A064490
• Smallest prime in which the n-th significant digit is a 1.at n=6A069588
• Smallest prime in which the n-th significant digit is a 0.at n=4A069597
• Smallest n-digit prime with minimum digit sum.at n=6A069663
• Triangle read by rows in which row n gives n smallest n-digit primes.at n=21A073914
• Numbers k such that there are no prime numbers between reverse(k) and 3*k.at n=14A074815
• a(1) = 2. Then the smallest n-digit prime starting with the last digit of the previous term.at n=6A077203
• Triangle, read by rows, in which the n-th row contains n smallest n-digit numbers.at n=24A081551
• Smallest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains smallest n-digit prime p such that dd(p) is also prime.at n=5A087595
• Numbers of the form 10^k + 1, 3, 7, or 9 for k>=1.at n=21A088265
• Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n.at n=26A090070