Showing what's behind the curtain

Investigating minimal repunits that divide by n.

Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it.

Determining the first forty prime factors of a very large repunit.

Investigating which primes will never divide a repunit containing 10**n digits.