Note: It is always recommended to use turbo mode on this project (shift-click on green flag) Simply press the green flag and type in a number. It must be a number with no non-numerical symbols, and it must be positive (if it's negative then an odd number of its factors must also be negative, but it would be impossible to say which ones). It factors it down to prime numbers. Each prime number is written in the form n^p, where n is the prime number and p is the number of times it occurs (unless it only occurs once, in which case it's just n). Each prime number is separated by a *. If it takes a while to generate the prime number list, an estimated time variable will start being calculated, although it is only updated every six seconds to reduce lag. It is not very accurate, as the length of time it takes to calculate each prime number goes up for each one, as well as the distance between each prime number is random, so it is quite likely to fluctuate; however, it does give a general idea of how long it will take. It also shows the latest prime number. Both of those variables are hidden once the prime number list is generated; do keep in mind that the factoring itself also sometimes can take a while, especially if the number has a lot of larger factors.
The prime number generation was mostly just the code from my prime number generator project, with some changes for use in this project.
