A palindromic number is a nonnegative integer whose usual digits in a fixed base read the same forwards and backwards,
where
is an integer and leading zeros are excluded. Unless
otherwise specified, base 10 is used. The first few decimal
palindromic numbers are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77,
88, 99, 101, 111, 121, ... (OEIS A002113).
The number of palindromic numbers less than a given number is illustrated in the
plot above.
A number
can be tested to see if it is palindromic in the Wolfram
Language using PalindromeQ[n].
The numbers of positive palindromic numbers less than 10, ,
, ... are 9, 18, 108, 198,
1098, 1998, 10998, ... (OEIS A050250). For
a positive integer
, this sequence is given
by the closed-form formula
|
(1)
|
Banks et al. (2004) proved that almost all palindromic numbers in any fixed base are composite. More
precisely, as
, they proved the big-O
notation estimate
|
(2)
|
where
is the number of palindromic primes
and
is the number of palindromic numbers
in base
. The implied constant
may depend on
.
Cilleruelo et al. (2018) proved that every positive integer is a sum of at most three palindromic numbers
in any integer base . Their algorithm
for explicitly producing these palindromic numbers is implemented interactively by
Baxter and Lawson-Perfect. Pegg (2026) gives a Wolfram
Language implementation.
Rajasekaran et al. (2018) proved that every nonnegative integer is a sum of at most four palindromic numbers in base 2, and of at most three in base 3 or 4. The bound of four in base 2 is optimal, since 176 cannot be expressed as a sum of three or fewer such numbers.
For a fixed integer base , let
count the positive integers
at most
that are a sum of two palindromic numbers. Zakharov (2024)
proved that, for some constant
,
|
(3)
|
Thus these integers have natural density zero. Zakharov counts positive palindromes,
but allowing 0 adds only possible sums and leaves
this conclusion unchanged. Cilleruelo et al. (2018) give the lower
bound
for some constant
and all sufficiently large
. The gap between these bounds remains open.
The sum of the reciprocals of the positive palindromic numbers converges
to a constant 3.3702832594...(OEIS A118031;
Rivera). The partial sum over positive
palindromic numbers
is 3.370001832....
The first few positive integers for which the pronic number
is palindromic are 1, 2, 16, 77, 538,
1621, ... (OEIS A028336), and the first few
positive palindromic numbers which are pronic
are 2, 6, 272, 6006, 289982, ... (OEIS A028337).
The first few positive integers whose squares
are palindromic are 1, 2, 3, 11, 22, 26, ... (OEIS A002778),
and the first few positive palindromic squares
are 1, 4, 9, 121, 484, 676, ... (OEIS A002779).
There are no palindromic square numbers with digits for
, 4, 8, 10, 14, 18, 20, 24, 30, ... (OEIS A034822).
Numbers that are not the sum of two palindromic numbers (where 0 is itself considered a palindrome) are 21, 32, 43, 54, 65, 76, 87, 98, 201, 1031, ... (OEIS A035137). Numbers that are not the difference of two palindromic numbers are 1020, 1029, 1031, 1038, 1041, 1047, 1051, 1061, ... (OEIS A104444).
The digits of an integer can be reversed in the Wolfram Language using IntegerReverse.