Determine if an integer is a palindrome in a given radix (base) Write a program that reads from stdin two integers, each newline terminated, hereafter called "number" and "radix", and:


Prints any fixed message you want if the number is a palindrome in that radix (e.g. true, t, 1)
Prints any different fixed message you want if the number is not a palindrome in that radix (e.g. false, f, 0, etc.)
These messages must be the same per each run, but there are no rules about what they must be (whatever's best for golfing).
You may assume the input is valid, two positive integers. "number" will not exceed 2147483647, "radix" will not exceed 32767.
You may not use external resources, but you may use any math function included by default in your language.


Note: a radix is just the base of the number.

Sample runs:

16
10
false

16
3
true

16
20
true

121
10
true

5
5
false

12346
12345
true

16781313
64
true

16781313
16
true
GolfScript, 10 characters
~base.-1%=

That is an easy one for GolfScript if we do it the straightforward way. The output is 0/1 for false/true.
~       # Take input and evaluate it (stack: num rdx)
base    # Fortunately the stack is in the correct order for
        # a base transformation (stack: b[])
.       # Duplicate top of stack (stack: b[] b[])
-1%     # Reverse array (stack: b[] brev[])
=       # Compare the elements