What is the fastest way to find all prime factors of a number?

Question

I have this code here which calculates all prime factors of n, and I am using it to find all prime factors of very large numbers (in the hundreds of thousands),