freeCodeCamp/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md

id, title, challengeType, forumTopicId, dashedName

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

--description--

For a positive integer n, let σ_2(n) be the sum of the squares of its divisors. Zum Beispiel,

σ_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--

divisorSquareSum() should return 1922364685.

assert.strictEqual(divisorSquareSum(), 1922364685);

--seed--

--seed-contents--

function divisorSquareSum() {

  return true;
}

divisorSquareSum();

--solutions--

// solution required