55511

Properties

Appears in sequences

• Primes that contain digits 1 and 5 only.at n=11A020453
• Primes in which each digit occurs in runs of at least 2.at n=11A034873
• Prime numbers with odd digits in descending order.at n=37A061245
• Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 61 for n > 0.at n=6A101732
• Smallest prime of the form: all fives followed by prime(n). a(n) >prime(n). 0 if no such prime exists.at n=4A114787
• Prime numbers n such that n = p1^3 + p2^3 + p3^3, a sum of cubes of 3 distinct prime numbers.at n=26A137365
• Subsequence of A137365 where it is possible to choose p1, p2, p3 so that p1+p2+p3 = prime.at n=24A137366
• Primes containing the string 555.at n=6A167281
• Primes having only {0, 1, 5} as digits.at n=29A199325
• Primes formed by inserting a semiprime between the semiprime's ordered factors.at n=12A229480
• Primes which become palindromic primes when the digits are rotated once to the right.at n=28A235000
• Primes having only {1, 4, 5} as digits.at n=31A260268
• Primes that can be generated by the concatenation in base 2, in descending order, of two consecutive integers read in base 10.at n=33A287019
• Primes that can be generated by the concatenation in base 4, in descending order, of two consecutive integers read in base 10.at n=26A287303
• a(n) = ((2*n+1)!!)^3 * (Sum_{k=1..n} 1/(2*k+1)^3).at n=3A335091
• Square array T(n,k), n>=0, k>=0, read by antidiagonals: T(n,k) = ((2n+1)!!)^k * Sum_{j=1..n} 1/(2*j+1)^k.at n=24A335095
• a(n) = ((2*n+1)!!)^n * (Sum_{k=1..n} 1/(2*k+1)^n).at n=3A335096
• a(n) is the numerator of (1134*n^3 + 2097*n^2 + 1188*n + 193)/(10368*n^4 + 20736*n^3 + 14112*n^2 + 3744*n + 320).at n=11A374607
• Prime numbers that yield a sphenic number when any digit is removed.at n=0A378863
• Primes having only {1, 2, 5} as digits.at n=37A385773