93739

Properties

Appears in sequences

• Palindromic in bases 3 and 10.at n=18A007633
• Palindromic and prime Fibonacci-lucky numbers.at n=38A039679
• Largest palindromic substring in n! without an initial zero.at n=29A046276
• Primes that are palindromic in bases 3 and 10.at n=3A046473
• Palindromic primes whose sum of squared digits is also prime.at n=32A052035
• Palindromic primes of the form 'primemirp' resulting from A054217.at n=16A054218
• Let p = abc..k be a prime in base 10. Define mirror(p) = abc...k...cba. Sequence gives primes of the form mirror(p) for some p.at n=21A068686
• Palindromic primes in which deleting the outside pair of digits yields a prime at every stage until finally a single-digit prime is obtained.at n=18A071119
• Palindromic primes with middle digit 7.at n=11A082443
• Primes arising in A084000.at n=2A084001
• Palindromic primes with property that sum of digits is prime and number of prime digits is prime.at n=28A093808
• Palindromic primes that start and end with 9.at n=6A128375
• Palindromic primes using only odd digits (1, 3, 5, 7 or 9).at n=34A159471
• Palindromic primes with d digits which have more than 3*d/2 distinct primes as substrings, for any d > 0.at n=7A168168
• Palindromic prime numbers == 4 (mod 9).at n=14A229499
• Primes p such that p+2, p+4, p+6, p+8, p+10 are semiprimes.at n=17A241959
• First prime in set of 3 palindromic primes in arithmetic progression ordered by the largest term in the progression.at n=31A244247
• Number of times an odious number is encountered when iterating from 2^(n+1)-2 to (2^n)-2 with the map x -> x - (number of runs in binary representation of x).at n=21A255064
• Minimal nested palindromic primes with seed 7.at n=2A261824
• Prime numbersat n=9047