freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md

---
id: 5900f3aa1000cf542c50febd
title: 'Problem 62: Cubic permutations'
challengeType: 5
forumTopicId: 302174
dashedName: problem-62-cubic-permutations
---

# --description--

The cube, 41063625 (345<sup>3</sup>), can be permuted to produce two other cubes: 56623104 (384<sup>3</sup>) and 66430125 (405<sup>3</sup>). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.

Find the smallest cube for which exactly five permutations of its digits are cube.

# --hints--

`cubicPermutations()` should return a number.

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

`cubicPermutations()` should return 127035954683.

```js
assert.strictEqual(cubicPermutations(), 127035954683);
```

# --seed--

## --seed-contents--

```js
function cubicPermutations() {

  return true;
}

cubicPermutations();
```

# --solutions--

```js
// solution required
```