Proof Writing & Problem Solving · Easy problem

Induction proves $n! \ge 2^{n-1}$ for every $n \ge 1$ (step: $(k+1)! = (k+1) \cdot k! \ge 2 \cdot 2^{k-1} = 2^k$). What lower bound does this inequality give for $10!$?