freeCodeCamp/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md

---
id: 5900f3e41000cf542c50fef6
title: 'Problem 119: Digit power sum'
challengeType: 5
forumTopicId: 301745
dashedName: problem-119-digit-power-sum
---

# --description--

The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$.

We shall define an to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum.

You are given that $a_2 = 512$ and $a_{10} = 614656$.

Find $a_{30}$.

# --hints--

`digitPowerSum()` should return `248155780267521`.

```js
assert.strictEqual(digitPowerSum(), 248155780267521);
```

# --seed--

## --seed-contents--

```js
function digitPowerSum() {

  return true;
}

digitPowerSum();
```

# --solutions--

```js
// solution required
```