2018-09-30 22:01:58 +00:00
---
id: 5900f4fd1000cf542c51000f
title: 'Problem 401: Sum of squares of divisors'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 302069
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
The divisors of 6 are 1,2,3 and 6.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
The sum of the squares of these numbers is 1+4+9+36=50.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.
2018-09-30 22:01:58 +00:00
Find SIGMA2(1015) modulo 109.
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler401()` should return 281632621.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler401(), 281632621);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function euler401() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler401();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```