11111111113
domain: N
Appears in sequences
- Smallest prime containing at least n consecutive identical digits.at n=9A034388
- Smallest n-digit prime containing only digits 1 and 3, or 0 if no such prime exists.at n=10A036930
- Smallest prime containing exactly n 1's.at n=10A037055
- Multiplicative and additive primes: primes where the product and sum of digits are also prime.at n=29A046713
- Smallest prime beginning with exactly n 1's.at n=10A065584
- Smallest n-digit prime with all odd digits.at n=10A068693
- Smallest n-digit prime in which the k-th digit is a divisor or a multiple of k, or 0 if no such prime exists.at n=10A069574
- Smallest prime in which a digit appears n times.at n=9A084673
- Primes arising in A087604, or 0 if A087604(n) = 0.at n=9A087609
- Primes of the form identical digits followed by a 3.at n=23A090146
- Least n-digit prime in which every two-digit string is also a prime, or 0 if no such number exists. (n-1 two-digit string primes occur.)at n=10A090534
- Least n-digit prime using digit 3 once and rest all 1, or 0 if no such prime exists.at n=10A090537
- Primes of the form 10*R_k + 3, where R_k is the repunit (A002275) of length k.at n=5A093011
- a(1) = 4; a(n) = (n^(n+1)+2*n-3)/(n-1) for n > 1.at n=9A093149
- Prime following n-th repunit.at n=10A096497
- a(n) = (10^n + 17)/9.at n=11A098406
- Primes with digital product = 3.at n=20A107689
- a(n) is the least prime containing n distinct occurrences of the n-th prime.at n=4A124046
- Smallest n-digit emirp (A006567) with nondecreasing digits.at n=9A127827
- Smallest prime beginning with exactly n identical digits.at n=9A131316