36.hs

import Data.List

numbers = [1..10^6]

convRadix :: (Integral b) => b -> b -> [b]
convRadix n =
   unfoldr (\b -> if b == 0 then Nothing else Just (b `mod` n, b `div` n))

isPalindrome10 n = sn == (reverse sn)
  where sn = show n

isPalindrome2 n = sn == (reverse sn)
  where sn = concatMap show $ convRadix 2 n

check ns = sum $ filter (\n -> isPalindrome10 n && isPalindrome2 n) ns

main =
    do putStrLn $ show $ check numbers