Числа-палиндромы

Numbers that read the same forwards and backwards: a mirror of mathematical symmetry

A palindromic number is a number that remains the same when its digits are reversed. From simple examples like 121 and 1331 to enormous primes, palindromes reveal a beautiful symmetry hidden within the number system. They appear in recreational mathematics, computer science, and even unsolved problems that have puzzled mathematicians for decades.

Математические свойства

Palindromic numbers have a well-defined structure. An n-digit palindrome is completely determined by its first half (plus the middle digit if n is odd). This means we can count exactly how many palindromes exist for each digit length:

The distribution of palindromes by digit count follows a clear pattern that doubles the available palindromes each time the digit length increases by two:

Palindromes with 1 cifra 9
Palindromes with 2 cifras 9
Palindromes with 3 cifras 90
Palindromes with 4 cifras 90
Palindromes with 5 cifras 900
Palindromes with 6 cifras 900
Palindromes with 7 cifras 9.000
Total palindromes up to 7 digits 10.998

Палиндромные простые числа

A palindromic prime is a number that is both a palindrome and a prime number. These doubly special numbers become increasingly rare as numbers grow larger.

Here are all palindromic primes up to 1,000:

An interesting fact: except for 11, all palindromic primes have an odd number of digits. This is because any even-digit palindrome is divisible by 11, and thus cannot be prime (with the sole exception of 11 itself).

Проблема 196

One of the most famous unsolved problems in recreational mathematics involves turning numbers into palindromes. The method is simple: take any number, reverse its digits, and add the two numbers together. Repeat until you get a palindrome.

Most numbers reach a palindrome within a few steps. But the number 196 is special -- despite billions of iterations and numbers with hundreds of millions of digits, no one has ever found a palindrome from 196.

56 → 56 + 65 = 121 1 paso
68 → 68 + 86 = 154 → 154 + 451 = 605 → 605 + 506 = 1111 3 pasos
89 → ... → 8.813.200.023.188 24 pasos
196 → ??? No palindrome found (billions of steps tested)

Numbers that may never produce a palindrome through this process are called Lychrel numbers. While 196 is the most famous candidate, it remains unproven whether it truly never reaches a palindrome -- making this one of the great open questions in number theory.

List of Palindromic Numbers (1-500)

Click on any palindromic number to see its full mathematical analysis.

Вы знали

Часто задаваемые вопросы

What defines a palindromic number precisely?

A palindromic number is a positive integer that reads identically forwards and backwards in decimal (or any chosen base) representation. For example, 121 is palindromic because reading digits left-to-right (1,2,1) equals right-to-left reading. Formally, if n = d₁d₂...d_k (digits in decimal representation), then n is palindromic if d_i = d_(k+1-i) for all i from 1 to k. This means single-digit numbers (1-9) are palindromic by definition. Zero is conventionally excluded from palindrome discussions despite technically satisfying the definition. Negative number palindromes are typically excluded due to ambiguity regarding the negative sign. The definition extends naturally to other bases—a number may be palindromic in decimal but not in binary, or vice versa. Multi-base palindromes are those palindromic in multiple bases simultaneously. The mathematical precision of this definition enables systematic study of palindromic properties across all positive integers.

How many n-digit palindromes exist?

For n-digit palindromes, the count follows a pattern based on position. One-digit palindromes: all 9 numbers (1-9) are palindromic. Two-digit palindromes: 9 numbers (11, 22, ..., 99) of form 11k (k=1 to 9). Three-digit palindromes: 90 numbers with form aba (a=1-9, b=0-9). Four-digit palindromes: 90 numbers with form abba (a=1-9, b=0-9). Five-digit palindromes: 900 numbers with form abcba (a=1-9, b,c=0-9). The general formula for n-digit palindromes: 9 × 10^⌊(n-1)/2⌋. For odd n, the middle digit can be any of 10 values; for even n, there's no middle digit. This formula enables calculating total palindromes up to n digits: sum from i=1 to n of 9 × 10^⌊(i-1)/2⌋. The growth rate of palindrome count is much slower than total integers, meaning palindromes become increasingly sparse for larger n—only about 1 in 10 million numbers near 10¹⁵ are palindromic.

What is the Lychrel number conjecture?

The Lychrel conjecture concerns the reverse-and-add process: starting with an integer, reverse its digits and add it to the original; repeat with the result. For example, starting with 19: 19+91=110, 110+011=121 (palindrome). The conjecture states that all positive integers eventually produce palindromes through this process. However, some numbers resist palindrome production despite millions of iterations. The smallest suspected Lychrel number is 196: after millions of iterations, it hasn't yielded a palindrome. Numbers like 879, 1997, 7986 similarly resist palindrome production. No proven Lychrel numbers exist; it's conjectured they either don't exist or are extremely rare. The conjecture's simplicity—applicable to children—contrasts with its mathematical intractability. Computing power enables testing to enormous iteration depths; 196 has been processed through billions of iterations without palindrome production, yet proof that it never produces a palindrome remains elusive. This accessible conjecture exemplifies open mathematical problems.

Изучите больше числовых концепций