GCDs II
Compute the GCD of the following two numbers:
Use \(^\) for exponentiation and \(*\) for multiplication in your answer.
To get the GCD of two numbers: iterate over all primes that appear in both factorizations; raise each of them to the smallest of its two exponents; then multiply the resulting powers.
By the way, if in this procedure you replace the smallest with the greatest, the return value will be the LCM (least common multiple) of the two numbers.