id	title	challengeType	forumTopicId	dashedName
5900f43f1000cf542c50ff52	Problem 211: Divisor Square Sum	5	301853	problem-211-divisor-square-sum

--description--

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

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.

--hints--

euler211() should return 1922364685.

assert.strictEqual(euler211(), 1922364685);

function euler211() {

  return true;
}

euler211();

// solution required