2, 3, 5, 7, 11, 101 131, 151, 181, 191, 313, 353, 373, 383, 727, 757, 767, 787, 797, 919, 929, 10301, 10501, 10601, 11311, 11411, 12421, 12721, 12821, 13331, 13831, 13931, 14341, 14741, 15451, 15551, 16061, 16361, 16561, 16661, 17471, 17971, 18181, 18481, 19391, 19891, 19991

It may be noticed that in the above list there are no 2- or 4- digit palindromic primes. If one considers the divisibility test for 11, it can be deduced any palindromic number with an even number of digits is divisible by 11.

It is not known if there are infinitely many palindromic primes in base 10. The largest known palindromic prime is 10^{11810} + 14654641 x 10^{5902} + 1. Author Paulo Ribenboim credits H. Dubner as being the foremost discoverer of large palindromic primes.

In binary, the easiest palindromic primes to find are Mersenne primes, since they are also repunit primes. The first four non-Mersenne palindromic primes in binary are 5 (101), 17 (10001), 73 (1001001) and 107 (1101011).

Ribenboim defines a **triply palindromic prime** as one, which, in addition to being a palindromic prime, also has a number of digits which is itself a palindromic prime. For example, 10^{11310} + 4661664 x 10^{5652} + 1, which has 11311 digits. It's possible that a triply palindromic prime in base 10 may be also be palindromic in another base, such as base 2, but it would be highly remarkable if it was also a triply palindromic prime in that base as well.