This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Large repunit factors

Problem 132

Published on 01 December 2006 at 06:00 pm [Server Time]

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


Answer:
Go to back to Problems