private static int invertDigits(long number) {
        long newNumber = 0;
        //You can here do something to make sure 'number' is not negative
        while (number >= 0) {
            newNumber = newNumber * 10 + number %10;
            number = number / 10;
        }
        return newNumber;
    }

    private static long invertDigits(long myNumber) {
        //You can here do something to make sure 'number' is not negative
//    	if (myNumber < 0) {
//    	    return -invertDigits(-myNumber);
//    	}
        long newNumber = 0;
        while (myNumber > 0) {
            newNumber = newNumber * 10 + myNumber %10;
            myNumber = myNumber / 10;
        }
        return newNumber;
    }

input == reverse(reverse(input))

public class Palindrome
{
    private int iteration = 0;

    private void calculatePalindrome(int number)
    {
        try {
            int reverse = reverse(number);

            if (number == reverse)
            {
                System.out.println(
                    "\nPalindrome found: [number = " + number
                    + "] & [reverse = " + reverse + "]\n");
            }
            else
            {
                System.out.println(
                    "Iteration " + ++iteration
                  + ": Number: " + number + ", Reverse: " + reverse
                  + ", Sum: " + (number + reverse) + ", Reverse: " + reverse(number + reverse));

                calculatePalindrome(number + reverse);
            }
        } catch (Exception e) {

        }
    }

    private int reverse(int num)
    {
        int x,y,z = 0;
        x = num;

        while (x > 0)
        {
            y = x % 10;
            x = x / 10;
            z = 10 * z + y;
        }

        return z;
    }

    public static void main(String[] args)
    {
        Palindrome p = new Palindrome();
        p.calculatePalindrome(1535);
    }
}

public class PalindromeFinder {
    /** inverts the decimal digits of a long value. myNumber must be bigger or equal 0
     * @param myNumer The number to be inverted
     * @return A number with the digits in reverse order
     */
    private static long invertDigits(long myNumber) {
        long newNumber = 0;
        while (myNumber > 0) {
            newNumber = newNumber * 10 + myNumber % 10;
            myNumber = myNumber / 10;
        }
        return newNumber;
    }
 
    /** Searches for a palindrome. Increments myNumber by invertDigits(myNumber) if myNumber is not a palindrome until the resulting value is a palindrome
     * @param myNumber The value for whom a palindrome is to be found. if (myNumber < 0) the result will be -searchForPalindrome(-myNumber)
     * @return The palindrome of the number.
     */
    public static long searchForPalindrome(long myNumber) {
        if (myNumber < 0)
            return -searchForPalindrome(-myNumber);
        long invertedNumber = 0;
        int counter = 0;
        do {
            myNumber+=invertedNumber;
            invertedNumber = invertDigits(myNumber);
            counter ++;
        } while (invertedNumber != myNumber);
        System.out.print(counter);
        return myNumber;
    }
 
    /** inverts the decimal digits of a long value. myNumber must be bigger or equal 0
     * @param myNumer The number to be inverted
     * @param divisor must in [2, 10]
     * @return A number with the digits in reverse order
     */
    private static long invertDigits(long myNumber, int divisor) {
        long newNumber = 0;
        while (myNumber > 0) {
            newNumber = newNumber * divisor + myNumber % divisor;
            myNumber = myNumber / divisor;
        }
        return newNumber;
    }
 
    public static void main(String[] args) {
//	System.out.println(invertDigits(415,8));
    	long[] myNumbers = new long[]{1495, 919, 1234, 415, 71247, 2572, 7257, -8316717, 512479};
    	for (long myNumber : myNumbers) {
	        System.out.print("Palindrome for " + myNumber + " after ");
	        long palindrome = searchForPalindrome(myNumber);
	        System.out.println(" step(s) is " + palindrome);
    	}
    }
}