id	title	challengeType	forumTopicId	dashedName
5900f3f11000cf542c50ff03	Problem 132: Large repunit factors	5	301760	problem-132-large-repunit-factors

--description--

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git

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).

--hints--

euler132() should return 843296.

assert.strictEqual(euler132(), 843296);

function euler132() {

  return true;
}

euler132();

// solution required