freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md

id, challengeType, title

id	challengeType	title
5900f3f11000cf542c50ff03	5	Problem 132: Large repunit factors

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

tests:
  - text: <code>euler132()</code> should return 843296.
    testString: 'assert.strictEqual(euler132(), 843296, "<code>euler132()</code> should return 843296.");'

Challenge Seed

function euler132() {
  // Good luck!
  return true;
}

euler132();

Solution

// solution required