The number of bits in $N!$ I'm struggling with this homework problem:
If $N$ is an $n$-bit number, how many bits long is $N!$ approximately (in $Θ(·)$ form)?
I know that the number of bits in $N$ is equivalent to log base $2$ of $N$, but that's about it. Any hints on where to start?

Look at Stirling's approximation
https://en.wikipedia.org/wiki/Stirling%27s_approximation
