freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md

---
id: 5900f3ab1000cf542c50febe
title: 'Problem 63: Powerful digit counts'
challengeType: 5
forumTopicId: 302175
dashedName: problem-63-powerful-digit-counts
---

# --description--

The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.

How many `n`-digit positive integers exist which are also an `n`th power?

# --hints--

`powerfulDigitCounts()` should return a number.

```js
assert(typeof powerfulDigitCounts() === 'number');
```

`powerfulDigitCounts()` should return 49.

```js
assert.strictEqual(powerfulDigitCounts(), 49);
```

# --seed--

## --seed-contents--

```js
function powerfulDigitCounts() {

  return true;
}

powerfulDigitCounts();
```

# --solutions--

```js
// solution required
```