freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md

---
id: 5900f4651000cf542c50ff77
title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
challengeType: 5
forumTopicId: 301895
dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
---

# --description--

The first number n for which φ(n)=13! is 6227180929.

Find the 150,000th such number.

# --hints--

`euler248()` should return 23507044290.

```js
assert.strictEqual(euler248(), 23507044290);
```

# --seed--

## --seed-contents--

```js
function euler248() {

  return true;
}

euler248();
```

# --solutions--

```js
// solution required
```