Number of prime factors of $n$

Question

Given an integer $n$, can somebody give me a formula to find (approximately) number of prime factors $n$ has?

Answer 1

Hardy and Ramanujan proved that for almost all integers, the number of distinct primes dividing a number $n$ is given by

$$ \omega(n) \sim \log\log n. $$