So as you guys may or may not know, there's a Project Euler task that has you find the largest palindrome of 2 three digit numbers multiplied by each other. Are you able to convert a number into a string, (because strings can be used as arrays and you can check if it's a palindrome by checking for instance, a[0] == a[3]) and then convert that string back into a number?