from collections import defaultdict
from collections import Counter
from itertools import chain


def prime_sieve(N):
    #sieve[i] : iの最小の素因数
    sieve = [0] * (N + 1)
    prime = []
    for i in range(2, N + 1):
        if sieve[i] == 0:
            sieve[i] = i
            prime.append(i)
        for p in prime:
            if p > sieve[i] or i * p > N:
                break
            sieve[i * p] = p
    return sieve


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return sorted(primes)


def get_primefactor(N):
    sieve = prime_sieve(N+10)
    pf = []
    while sieve[N]:
        pf.append(sieve[N])
        N, m = divmod(N, sieve[N])
    return pf


N, K = map(int, input().split())
cnt = Counter(get_primefactor(N))

# まずはK個素因数を割り当て
ans = 1
get = defaultdict(int)
while K:
    for key in sorted(cnt.keys()):
        if cnt[key]:
            ans *= key
            cnt[key] -= 1
            get[key] += 1
            K -= 1
        if not K:
            break

primes = prime_set(10**5+1)
for P in range(1, 20):
    for pr in primes:
        if ans * pr >= N:
            break
        if get[pr] >= P:
            continue
        get[pr] += 1
        ans *= pr
print(ans)