Enter the number you want the prime factors of and this code will tell you the prime factors
Basically the code finds the factors of the function, then finds the factors of each factor. It deletes all of the original factors who have more than two factors. This finds each prime factor. Then it multiplies the remaining factors together and divides the sum by that to find what factor is multiplied by the prime factors to get the original number, and the prime factors of that number are added to the set of prime factors. Again they are multiplied together and the process is repeated until all of the prime factors multiplied together gives the original number This was 100% by me
