Strictly non-palindromic number
A strictly non-palindromic number is an integer n that is not palindromic in any numeral system with a base b in the range 2 ≤ b ≤ n − 2. For example, the number six is written as 110 in base 2, 20 in base 3 and 12 in base 4, none of which is a palindrome—so 6 is strictly non-palindromic.
For another example, the number 167 written in base b (2 ≤ b ≤ 165) is:
and none of which is a palindrome, so 167 is also a strictly non-palindromic number.
The sequence of strictly non-palindromic numbers (sequence in the OEIS) starts:
To test whether a number n is strictly non-palindromic, it must be verified that n is non-palindromic in all bases up to n − 2. The reasons for this upper limit are:
For example, 167 will be written as: (if b > 165)
Thus it can be seen that the upper limit of n − 2 is necessary to obtain a mathematically "interesting" definition.
For n < 4 the range of bases is empty, so these numbers are strictly non-palindromic in a trivial way.
All strictly non-palindromic numbers beyond 6 are prime. To see why composite n > 6 cannot be strictly non-palindromic, for each such n a base b can be shown to exist where n is palindromic.
Otherwise n is odd. Write n = p · m, where p is the smallest prime factor of n. Then clearly p ≤ m. (Since n is composite)
Otherwise p < m − 1. The case p = m − 1 cannot occur because both p and m are odd.
The reader can easily verify that in each case (1) the base b is in the range 2 ≤ b ≤ n − 2, and (2) the digits ai of each palindrome are in the range 0 ≤ ai < b, given that n > 6. These conditions may fail if n ≤ 6, which explains why the non-prime numbers 1, 4 and 6 are strictly non-palindromic nevertheless.
...
Wikipedia