用python求一个数的最大素因数

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(num**0.5) + 1):
        if num % i == 0:
            return False
    return True

def max_prime_factor(num):
    for i in range(int(num**0.5), 1, -1):
        if num % i == 0 and is_prime(i):
            return i
    return num

number = 1234567890
max_factor = max_prime_factor(number)
print("最大素因数为:", max_factor)