Smallest Non-Palindromic Number with Palindromic Square

Theorem
$26$ is the smallest non-palindromic integer whose square is palindromic.

Proof
Checking the squares of all non-palindromic integers in turn from $10$ upwards, until a palindromic integer is reached: