Project Euler 36 - Double-base palindromes

Official link:

Thought Process

Not that much thought for this one, I simply loop through x from 1 to 10^6 and check if str(x) = str(x)[::-1], if this is true I use the bin function to see if bin[2:] = bin[2:][::-1] and if this is true I add x to a running total

Interactive Code

Input an integer (yourinput)

Code will output the sum of all base 10 and base 2 palindromes < yourinput along with them