31379

Properties

Appears in sequences

• Primes > 1000 in which every substring of lengths 2 and 3 are also prime.at n=10A069490
• Prime(n) and prime(n+4) use the same digits.at n=29A069796
• Smallest prime with n prime substrings (excluding prime itself but allowing leading zeros).at n=11A085822
• Primes arising in A090234.at n=13A090235
• Primes such that least significant digit swapped with all other digits yields primes.at n=40A090934
• Prime means of 12 horizontal, vertical and main diagonal sums associated with primes in A094458.at n=14A094459
• Primes equal to a sum of primes with differences congruent to (2,4) mod 6.at n=20A104160
• Primes p such that p's set of distinct digits is {1,3,7,9}.at n=18A108386
• Prime sequence overlaying the central digits of prime numbers. If possible, the value is greater than the previous one. Zero if no such embedding is possible.at n=32A133781
• Primes of the form m*(m+1)/2 + 4.at n=38A159048
• Primes with d digits (d>0) which have more than 2d distinct primes as substrings.at n=1A168169
• Primes with ten embedded primes.at n=1A179918
• Prime numbers containing the digit string 137.at n=24A190307
• Minimal prime with n prime substrings (substrings with leading zeros are considered to be nonprime).at n=11A213321
• G.f.: x^4*(6 + x - 7*x^2 - x^3 + 3*x^4 + x^5)/(1-x-x^2)^3.at n=15A229731
• Largest prime that can be obtained from n by successively appending digits to the right with the constraint that each of the numbers obtained that way must be prime; a(n)=0 if there is no such prime at all.at n=30A232129
• Super-prime leaders: right-truncatable primes p with property that appending any single decimal digit to p does not produce a prime.at n=11A239747
• G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x^2)*A(x^3)*A(x^5)* ... *A(x^prime(k))* ...at n=35A308271
• Primes of the form p+q+r where p < q < r = p+6 are consecutive primes.at n=35A309354
• Number of subsets of {1..n} containing all of their pairwise sums <= n.at n=26A326083