2018-10-10 22:03:03 +00:00
---
id: 5900f4fd1000cf542c51000f
2021-02-06 04:42:36 +00:00
title: 'Problem 401: Sum of squares of divisors'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 302069
2021-01-13 02:31:00 +00:00
dashedName: problem-401-sum-of-squares-of-divisors
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
The divisors of 6 are 1,2,3 and 6.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
The sum of the squares of these numbers is 1+4+9+36=50.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +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.
Find SIGMA2(1015) modulo 109.
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler401()` should return 281632621.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler401(), 281632621);
2018-10-10 22:03:03 +00:00
```
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler401() {
return true;
}
euler401();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
```js
// solution required
```