F₅ is 2³² + 1 and the workbench prints 4.294967297⋅10+9, because from 100 000 up the screen writes a result with an exponent instead of as digits. Multiplying Euler's two factors, 641 × 6700417, prints exactly the same line — which is what a factorization means. Fermat computed F₀ through F₄ — 3, 5, 17, 257, 65537 — saw that all five are prime, and guessed the pattern continued; F₅ is where it breaks.
The converter's four rows put the number in its natural dress: hexadecimal 100000001, binary 100000000000000000000000000000001 — a one, thirty-one zeros, and another one. Euler's shortcut was to look for a factor of the form 64k + 1 and find 641 = 5⁴ + 2⁴, then notice that the same 641 is 5·2⁷ + 1, which makes it divide 2³² + 1 without any division being performed. The first four Fermat numbers, 3, 5, 17 and 257, are the side counts of regular polygons that compass and straightedge can draw: Euclid constructed the triangle and the pentagon, Gauss took the 17-gon in 1796 and stated in 1801 that every power of two times distinct Fermat primes is constructible, and Wantzel supplied the other half in 1837 — that nothing else is.
Answer
4.294967297⋅10+9
How to read it
2³² + 1 on the workbench; 641 × 6 700 417 prints the same line. The third link is the number in four bases at once.
Source
Fermat conjectured that Fₙ = 2^(2ⁿ) + 1 is prime for every n; F₅ = 4 294 967 297 = 641 × 6 700 417, factored by Euler around 1732 using 641 = 5⁴ + 2⁴ = 5·2⁷ + 1, which divides 2³² + 1
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.