1114111

Properties

Appears in sequences

• Primes that contain digits 1 and 4 only.at n=9A020452
• Smallest n-digit prime containing only digits 1 and 4, or 0 if no such prime exists.at n=6A036931
• Primes of the form m*2^phi(m)-1 with phi(m) the Euler function, in order of increasing m.at n=6A046153
• Palindromic primes containing at least one pair of consecutive equal digits.at n=20A050786
• Smallest prime beginning and ending in exactly n 1's and containing at least one digit != 1.at n=3A068160
• Palindromic primes with digit sum 10.at n=4A070250
• Smallest zero-free palindromic prime of 2n + 1 digits.at n=3A071606
• Palindromic wing primes (a.k.a. near-repdigit palindromic primes) of the general form r*(10^d - 1)/9 + (m-r)*10^floor(d/2) where d is the number of digits (an odd number > 1), r is the repeated digit, and m (different from r) is the middle digit.at n=21A077798
• Palindromic primes with middle digit 4.at n=11A082440
• Palindromic primes using only nonprime digits (0,1,4,6,8,9).at n=21A083185
• Smallest palindromic prime containing exactly n 1's.at n=5A083972
• a(n) = n^2 concatenated with reverse(n^2) divided by 11.at n=35A084009
• Least palindromic prime that strictly encloses the n-th palindromic prime, or 0 if no such prime exists.at n=24A084412
• Palindromic primes with nondecreasing digits up to the middle and then nonincreasing.at n=34A084836
• Smallest palindromic prime containing the n-th palindrome.at n=20A085054
• a(n) = (n+1) * 2^n - 1.at n=16A087323
• Let f(n) be the n-th palindrome in A089743. Then a(n) is the smallest palindromic prime that begins with f(n).at n=11A088277
• a(1) = 11; for n > 1, palindromic primes in which a single digit is sandwiched between strings of '1's.at n=8A088281
• Palindromes in A090272.at n=7A090271
• Take each palindrome ending in 1, 3, 7, or 9 and find smallest prime formed by the digits of that palindrome, followed by a string of digits, followed by the palindrome again.at n=9A090272