A positive integer n is a b-adic palindrome if the representation of n in base b reads the same backward as forward. Let s_b be the reciprocal sum of all b-adic palindromes. In this article, we obtain upper and lower bounds, and an asymptotic formula for s_b. We also show that the sequence (s_b)_{b ≥ 2} is strictly increasing and log-concave.