In the answers of another question (Effective Upper Bound for the Number of Prime Divisors) I found the following proposition:
The number of prime divisors counted with multiplicity is maximized for powers of $2$ and so
$$\Omega(n)\le\frac{\log n}{\log 2}=\log_2 n$$
Can someone give me a formal proof for this?