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