I would like to prove
$$\omega(n) \le \frac{\ln{n}}{\ln\ln{n}}$$
This is a quite standard result, but I haven't been able to find a proof. Here's what I've tried doing:
$$n=\prod\limits_{i=1}^kp_i^{a_i}\ge \prod\limits_{i=1}^kp_i\approx 2\prod\limits_{i=2}^ki\ln{i}=2P_1P_2,$$ where $P_1=\prod\limits_{i=2}^ki$ and $P_2=\prod\limits_{i=2}^k\ln{i}$. $$P_1=k!$$ $$\ln(P_2)=\sum\limits_{i=2}^k \ln\ln{i} \approx \int_2^k \! \ln\ln{x} \, \mathrm{d}x \approx k\ln\ln{k}.$$ $$P_2=\ln^kk.$$ $$n\ge2P_1P_2 \approx 2\sqrt{2\pi}k^{k+\frac{1}{2}}e^{-k}\ln^kk$$ $$\ln{n} \approx \ln2+\ln{\sqrt{n\pi k}}+k\ln{k}-k+k\ln\ln{k}$$
but not really sure where to go from here.
It appears you have the inequality backwards. Also, all I find is an asymptotic result for the primorial numbers, in Hardy and Wright. Therefore, i am not entirely sure the inequality indicated by the computer run holds forever, maybe sometimes it goes the other way. Below is data for the first 25 primorials. I indicate the largest prime factor with lower case p, the primorial with upper case P.
Afterthought: maybe for all numbers $n \geq 2,$ primorial and otherwise, we get something like $\omega(n) < 2 \log n / \log \log n.$
Found it, there is an explicit reference in the comments: Effective Upper Bound for the Number of Prime Divisors with the result by G. Robin. Comment by Gerry Myerson: Estimation de la fonction de Tchebychef θ sur le k-ieme nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n, Acta Arith 42 (1983) 367-389, MR0736719 (85j:11109).