This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Divisor Square Sum

Problem 211

Published on 04 October 2008 at 02:00 am [Server Time]

For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example,

σ2(10) = 1 + 4 + 25 + 100 = 130.

Find the sum of all n, 0 < n < 64,000,000 such that σ2(n) is a perfect square.


Answer:
Go to back to Problems