Check if the Binary Representation of a number is Palindrome or not

BinaryPalinDrome

    public static int countNumberofOneBit(int number){
        int count=0;
        while (number!=0){
            count++;
            number=(number-1)&number;
        }
        return count;
    }

    public static int countNumberofNonLeadingZeroBit(int number){
        int result=0;
        while (number!=0){
            if((number & 1)==0){
                result++;
            }
            number >>>= 1;
        }
        return result;
    }

    public static boolean isSet(int number, int k){
        return ((number & (1<<k-1)) !=0);
    }

    public static boolean isPallindrome(int number){
        int totalBit = countNumberofOneBit(number)+countNumberofNonLeadingZeroBit(number);
        int start=1;
        while (start<totalBit){
            if(isSet(number,start) != isSet(number,totalBit)){
                return false;
            }
            start++;
            totalBit--;
        }
        return true;
    }