Finding Prime Factorizations

Write a class named PrimeFactorizationFinder that takes a single command-line argument (an integer) and then displays the prime factorization of that integer.

As the below examples suggest, the prime factorization should be displayed as a product of prime powers. Note in particular how prime powers with exponents of zero and one are handled in the these examples -- your code should behave similarly.

Sample runs:

$ java PrimeFactorizationFinder 360
The prime factorization of 360 is 2^3 * 3^2 * 5
$ java PrimeFactorizationFinder 98
The prime factorization of 98 is 2 * 7^2
$ java PrimeFactorizationFinder 1055214706
The prime factorization of 1055214706 is 2 * 7^2 * 13^5 * 29