← Complete problem index

PROJECT EULER · #0211

Divisor Square Sum

Statement only · SolvedOriginal problem ↗

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<64000000 such that σ2(n) is a perfect square.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.