The sum of the squares of certain unusual integers is equal to the concatenation of their individual digits.
1233 = 12^2+33^2
990100 = 990^2+100^2
Given a number n, write a function that returns true if the number displays this property, and false otherwise. The number of digits will always be even.
This problem is inspired by this blog post: http://benvitalenum3ers.wordpress.com/2013/03/12/concatenation-x-y-x2-y2/