---
id: 5900f43f1000cf542c50ff52
challengeType: 5
title: 'Problem 211: Divisor Square Sum'
videoUrl: ''
localeTitle: 'Problema 211: soma quadrada do divisor'
---

## Description
<section id="description"> Para um inteiro positivo n, seja σ2 (n) a soma dos quadrados de seus divisores. Por exemplo, σ2 (10) = 1 + 4 + 25 + 100 = 130. Encontre a soma de todos n, 0 &lt;n &lt;64.000.000 tais que σ2 (n) é um quadrado perfeito. </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler211()</code> deve retornar 1922364685.
    testString: 'assert.strictEqual(euler211(), 1922364685, "<code>euler211()</code> should return 1922364685.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler211() {
  // Good luck!
  return true;
}

euler211();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>