freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md

---
id: 5900f4c31000cf542c50ffd5
title: 'Problem 342: The totient of a square is a cube'
challengeType: 5
forumTopicId: 302001
dashedName: problem-342-the-totient-of-a-square-is-a-cube
---

# --description--

Consider the number 50.

502 = 2500 = 22 × 54, so φ(2500) = 2 × 4 × 53 = 8 × 53 = 23 × 53. 1

So 2500 is a square and φ(2500) is a cube.

Find the sum of all numbers n, 1 < n < 1010 such that φ(n2) is a cube.

1 φ denotes Euler's totient function.

# --hints--

`euler342()` should return 5943040885644.

```js
assert.strictEqual(euler342(), 5943040885644);
```

# --seed--

## --seed-contents--

```js
function euler342() {

  return true;
}

euler342();
```

# --solutions--

```js
// solution required
```