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

---
id: 5900f43f1000cf542c50ff52
challengeType: 5
title: 'Problem 211: Divisor Square Sum'
videoUrl: ''
localeTitle: 'Problema 211: Divisor Cuadrado Suma'
---

## Description
<section id="description"> Para un entero positivo n, sea σ2 (n) la suma de los cuadrados de sus divisores. Por ejemplo, σ2 (10) = 1 + 4 + 25 + 100 = 130. Encuentre la suma de todos n, 0 &lt;n &lt;64,000,000 de manera que σ2 (n) sea un cuadrado perfecto. </section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler211()</code> debe devolver 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>