---
id: 5900f3f11000cf542c50ff03
challengeType: 5
title: 'Problem 132: Large repunit factors'
forumTopicId: 301760
---
## Description
A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k.
For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414.
Find the sum of the first forty prime factors of R(109).
## Instructions
## Tests
```yml
tests:
- text: euler132() should return 843296.
testString: assert.strictEqual(euler132(), 843296);
```
## Challenge Seed
```js
function euler132() {
return true;
}
euler132();
```