Any composite number is measured by some prime number.
Proof
Descend through divisors: a composite has a proper divisor, that
divisor is either prime or composite; if composite, repeat. The
descent must terminate (numbers are bounded below by 2), so a prime
divisor exists.