Let $s(m)$ denote the sum of the digits of the positive integer $m$. Find the largest positive integer that has no digits equal to zero and satisfies the equation \[2^{s(n)} = s(n^2).\]

Let's think step by step and output the final answer within \boxed{}.
user