find multiple quick (solve Jevons's number) - python

jevons.py

def findMulti(num: int) -> tuple:
    limit = int(num ** 0.5) + 1
    for a in range(1, limit):
        if num % a == 0:
            b = num // a
            if not 1 in (a, b):
                return a, b
    return False

print(findMulti(8616460799))