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.