int_palindrome.py

def int_palindrome(num: int):
    _list = []
    i = 1
    int_length = int(math.log10(num)) + 1 
    size_zeroes = 10**int_length
    for j in range(size_zeroes):
        if i >= size_zeroes:
            break
        
        digit = (num%(10*i))//i
        _list.append(digit)
        i *= 10
    return _list[:] == _list[::-1]
  
  #driver code
  
  if __name__ == "__main__":
    print(int_palindrome(12345))