---
id: 5900f51e1000cf542c510030
challengeType: 5
title: 'Problem 432: Totient sum'
---
## Description
Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
You are given that S(510510,106 )= 45480596821125120.
Find S(510510,1011).
Give the last 9 digits of your answer.
## Instructions
## Tests
```yml
tests:
- text: euler432() should return 754862080.
testString: 'assert.strictEqual(euler432(), 754862080, "euler432() should return 754862080.");'
```
## Challenge Seed
```js
function euler432() {
// Good luck!
return true;
}
euler432();
```