This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Fermat's sum of two squares theorem says that any prime that is congruent to 1 mod 4 can be written as the sum of two perfect squares. Since 2 0 1 6 is divisible by 4, 2017 satisfies this condition.
It turns out that 4 4 2 + 9 2 = 2 0 1 7 .