Contrapositive and Contradiction · Challenge problem

"If $2^n - 1$ is prime, then $n$ is prime" is proved by contrapositive: if $n = rs$ with $1 < r < n$, then $2^r - 1$ divides $2^n - 1$. Using this, what is the smallest prime factor of $2^{15} - 1$?