Minimum number of comparisons in comparison-based sorting algorithms

I’ve seen that every comparison-based sorting algorithm must perform at least $ \log_{2}(n!)=\Omega(nlog(n))$ comparisons on some input (n being the size of the input).

Why is the minimum number of comparisons $ \log_{2}(n!)$ , and how is the omega-notation bound calculated?