# Repunit Factors

**Number Theory**Level 5

*ministring* be a sequence of digits composed of a nonnegative integer amount of the ' \(0\)' digit followed by a positive integer number of the ' \(1\)' digit. Find the number of divisors of \(R_{20}\) that consist entirely of copies of a single *ministring*.

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.