### rogerfederer07's blog

By rogerfederer07, history, 14 months ago,

Is there any formula for calculating the count of prime factors of a number 'N'? I know the loose upper bound is log2(N) but is there a better upper bound? Thanks.

• +7

 » 14 months ago, # |   +5 There is no deterministic solution as of now, but it is a very famous fact that Hardy and Ramanujan proved that "for most numbers" (in the probabilistic sense), the number of distinct prime factors of a number $n$ is $log(log(n))$. Hardy-Ramanujan Theorem
•  » » 14 months ago, # ^ |   0 thanks for the info