Smallest positive number whose y-th power is divisible by x Task

Given integers x and y which are both at least 2, find the smallest positive number whose y-th power is divisible by x.

Example

Given x=96 and y=2, the output should be 24 since 24 is the smallest positive n satisfying n^2 is divisible by 96.

Testcases

x  y output
26 2 26
96 2 24
32 3 4
64 9 2
27 3 3


Scoring

This is code-golf. Solution with lowest byte-count wins.

References


y=2: OEIS A019554
y=3: OEIS A019555
y=4: OEIS A053166
y=5: OEIS A015052
y=6: OEIS A015054
Brachylog, 19 17 16 15 12 bytes
2 bytes saved thanks to @LeakyNun.
:[I:1]*$r=#&gt;

Try it online!
Explanation
               Input = [X, Y]
:[I:1]*        Get a list [X*I, Y] (I being any integer at this point)
       $r=     Get the first integer which is the Yth root of X*I
          #&gt;   This integer must be strictly positive
               This integer is the Output