freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md

---
id: 5900f4791000cf542c50ff8b
title: >-
  Problem 268: Counting numbers with at least four distinct prime factors less than 100
challengeType: 5
forumTopicId: 301917
dashedName: >-
  problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
---

# --description--

It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.

Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.

# --hints--

`euler268()` should return 785478606870985.

```js
assert.strictEqual(euler268(), 785478606870985);
```

# --seed--

## --seed-contents--

```js
function euler268() {

  return true;
}

euler268();
```

# --solutions--

```js
// solution required
```