Almost All Palindromes Are Composite

William D. Banks, Derrick N. Hart, Mayumi Sakata
2004 Mathematical Research Letters  
We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite.
doi:10.4310/mrl.2004.v11.n6.a10 fatcat:eonscto7lnbkzpv6vpmhqpurtu