Click Gobo to begin! It recursively breaks down the input number until there are only prime factors left. This is very optimized, and there are also annotations in the code if you would like to see them.
This will break with ridiculously large numbers and lists 2 as a factor something like 30 times, but that is due to the limitations of Scratch, not the limitations of this engine.
