101113

Properties

Appears in sequences

• Primes occurring in exactly three prime triples (p,q,r) with p<q<r=p+6.at n=21A098423
• Digit count of prime(n). The digit count numerically summarizes the frequency of digits 0 through 9 in that order when they occur in a number.at n=26A127354
• Primes n that are concatenation of two 3-digit primes p<q.at n=1A168529
• Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).at n=31A210465
• Primes that are the concatenation of two 3-digit primes.at n=1A255976
• Decimal repunits written in base 4.at n=4A353143
• Let u defined by u(1) = p and for 1 < i, u(i) = u(i-1) + primorial(i), such that all u(i) are primes for 1 <= i <= k, and u(k+1) is not prime. Let m the length of the longest run of primes obtained when u is repeatedly applied to an n-digit p. Triangle read by rows: for 1 <= n, 1 <= k <= m, T(n,k) is the least n-digit prime p beginning a run of only k primes when applied u, or -1 if no such prime p exists.at n=45A356732
• Prime numbersat n=9683