public static int reverseItRecursive(int number) { if (number == 0) return 0; int n = number; int pow = 1; while (n >= 10) { n = n / 10; pow = pow * 10; } return (n + reverseItRecursive(number - n*pow)*10); }