Hardy–Ramanujan theorem

In mathematics, the Hardy–Ramanujan theorem, proved by Ramanujan and checked by Hardy states that the normal order of the number ${\displaystyle \omega (n)}$ of distinct prime factors of a number ${\displaystyle n}$ is ${\displaystyle \log \log n}$.

Roughly speaking, this means that most numbers have about this number of distinct prime factors.