---
id: 5900f4ae1000cf542c50ffbf
challengeType: 5
title: 'Problem 320: Factorials divisible by a huge integer'
---
## Description
Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890
Let S(u)=∑N(i) for 10 ≤ i ≤ u.
S(1000)=614538266565663.
Find S(1 000 000) mod 1018.
## Instructions
## Tests
```yml
tests:
- text: euler320() should return 278157919195482660.
testString: 'assert.strictEqual(euler320(), 278157919195482660, "euler320() should return 278157919195482660.");'
```
## Challenge Seed
```js
function euler320() {
// Good luck!
return true;
}
euler320();
```