Power values of palindromes

Javier Cilleruelo, Florian Luca, Igor E. Shparlinski

Research output: Contribution to journalArticlepeer-review


We show that for a fixed integer base g ≥ 2 the palindromes to base g which are k-powers form a very thin set in the set of all base g palindromes. On the other hand, we also give a lower bound which shows that there are more such palindromes than some standard heuristic arguments suggest.
Original languageEnglish
Pages (from-to)101-107
Number of pages7
JournalJournal of combinatorics and number theory
Issue number2
Publication statusPublished - 2009


  • palindromes
  • powers


Dive into the research topics of 'Power values of palindromes'. Together they form a unique fingerprint.

Cite this