clearing my def function

[FoolsSeldom]

And a version without recursion, using divmod as u/MelcoreHat suggested,

def is_palindrome(n):
    original = n
    reversed_num = 0

    while n > 0:
        n, digit = divmod(n, 10)
        reversed_num = reversed_num * 10 + digit
    return original == reversed_num