integer algorithms

How can I speed up my palindrome number check without converting to a string?

I'm checking whether an integer is a palindrome in Python. My recursive version collects digits in a list, but it feels unnecessarily complicated. Is there a faster way…