freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.spanish.md

---
id: 5900f5331000cf542c510046
challengeType: 5
title: 'Problem 455: Powers With Trailing Digits'
videoUrl: ''
localeTitle: 'Problema 455: Poderes con dígitos finales'
---

## Description
<section id="description"> Sea f (n) el mayor entero positivo x menos de 109, de modo que los últimos 9 dígitos de nx formen el número x (incluidos los ceros a la izquierda), o cero si no existe tal entero. <p> Por ejemplo: </p><p> f (4) = 411728896 (4411728896 = ... 490411728896) f (10) = 0 f (157) = 743757 (157743757 = ... 567000743757) Σf (n), 2 ≤ n ≤ 103 = 442530011399 Encuentra Σf (n) ), 2 ≤ n ≤ 106. </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler455()</code> debe devolver 450186511399999.
    testString: 'assert.strictEqual(euler455(), 450186511399999, "<code>euler455()</code> should return 450186511399999.");'

```

</section>

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

<div id='js-seed'>

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

euler455();

```

</div>



</section>

## Solution
<section id='solution'>

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