Problem 133 of Project Euler is a continuation of Problem 132 and Problem 129 in which we are supposed to find the some prime numbers which are not factors of R(10^{n}) for any n. In fact the problem reads

A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of lengthk; for example, R(6) = 111111.

Let us consider repunits of the form R(10^{n}).

Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17. Yet there is no value ofnfor which R(10^{n}) will divide by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can be a factor of R(10^{n}).

Find the sum of all the primes below one-hundred thousand that will never be a factor of R(10^{n}).