Find the prime factors In this task, you have to write a program, that computes the prime factors of a number. The input is a natural number 1 &lt; n &lt; 2^32. The output is a list of the prime factors of the number in the following format. Exponents must be omitted if they are 1. Only output prime numbers. (Assuming the input is 131784):


  131784 = 2^3 * 3 * 17^2 * 19


Using the same amount of whitespace is not required; whitespace may be inserted wherever appropriate. Your program should complete in less then 10 minutes for any input. The program with the shortest amount of characters wins.
SageMath, 31 Bytes
N=input()
print N,&quot;=&quot;,factor(N)

Test case:
83891573479027823458394579234582347590825792034579235923475902312344444
Outputs:
83891573479027823458394579234582347590825792034579235923475902312344444 = 2^2 * 3^2 * 89395597 * 98966790508447596609239 * 263396636003096040031295425789508274613