---
id: 5900f3e41000cf542c50fef6
challengeType: 5
title: '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 83 = 512. Another example of a number with this property is 614656 = 284.
We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.
You are given that a2 = 512 and a10 = 614656.
Find a30.
## Instructions
## Tests
```yml
tests:
- text: euler119() should return 248155780267521.
testString: assert.strictEqual(euler119(), 248155780267521, 'euler119() should return 248155780267521.');
```
## Challenge Seed
```js
function euler119() {
// Good luck!
return true;
}
euler119();
```