Linear congruence in jellybeans

Jarryboy wants to make jellybeans. He has a machine that produces a positive integer number $n$ of jellybeans. He notices that whenever he divides $n$ by $2$, $3$, $5$, or $7$, the remainders are $1$, $2$, $4$, and $6$, respectively. Furthermore, $n$ is divisible by $11$. What is the smallest possible value of $n$?