Fermat, Euler and Wilson · Superchallenge problem

Find the smallest positive integer $n$ such that $2^n - 1$ is divisible by $1001 = 7 \cdot 11 \cdot 13$.