Javascript (ES6), 42 bytes
f=(n,i=1)=>n<i?0:n%i?f(n,i+1):1+f(n/i,i+1)
There's probably a few bytes that can be saved here and there. Just uses the greedy algorithm for the factors.
1 of 3
user83717