# A general question about strictly non-palindromic numbers

@Woett. Possible answer : Proving that there are infinitely many palindromic primes would be some kind of weak version of the difficult conjecture that there are infinitely many primes of the form $n^2+1$ (not sure however this is any easier). –  François Brunault May 31 '11 at 8:57
@Stanley Yao Xiao : There are some heuristic arguments predicting the asymptotic number of primes of the form $n^2+1$. See for example the Bateman-Horn conjecture en.wikipedia.org/wiki/Bateman%E2%80%93Horn_conjecture Maybe the same kind of ideas could be used to at least guess the asymptotic number of strictly non-palindromic numbers. –  François Brunault May 31 '11 at 9:08