Once upon a time Fermat claimed that (2^2^n) + 1 is always prime but then....
Euler came in and found a counterexample in 1742.
So what number does indeed divide (2^2^n) + 1?