Proof Writing & Problem Solving · Easy problem

Euclid's proof by contradiction assumes the primes are only $2, 3, 5, 7, 11, 13$ and forms $N = 2 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 + 1 = 30031$. No listed prime divides $N$. What is the smallest prime that does divide $N$?