Reverse the bits of a number and check if the number is palindrome or not

public static void main(String[] args) {
        int originalNumber = 9;
        long numBitsReversed = reverseBitsV1(originalNumber);
        long result = originalNumber ^ numBitsReversed; (1)
        if (result == 0) {
            System.out.println("Number is Palindrome");
        } else {
            System.out.println("Number is not Palindrome");
        }
    }

public static int reverseBitsV1(int number) {
    int reverse = 0;
    while (number != 0) {
        reverse <<= 1;  //left shift `reverse` by 1
        reverse |= (number & 1);   //Copy the rightmost bit of `number` into `reverse`
        number >>= 1;  //right shift `number` by 1
    }
    return reverse;
}

public static int reverseBitsV2(int number) {
    int reverse = 0;
    //Traversing bits of 'number' from the right and pushing it into left of `reverse` number
    while (number > 0) {
        reverse <<= 1; //Bitwise left shift 'reverse' by 1
        if ((number & 1) == 1) //if current bit is '1'
            reverse ^= 1; //Bitwise right shift 'number' by 1
        number >>= 1;
    }
    return reverse;
}