Last Updated : 11 Jul, 2025
Prerequisite: BigInteger Basics
The java.math.BigInteger.bitCount() method returns number of bits in the two's complement representation of this BigInteger that differ from its sign bit. This method is useful when implementing bit-vector style sets atop BigIntegers.
Syntax:
public int bitCount()
Parameters: The method does not take any parameters.
Return Value: The method is used to return the number of bits in the two's complement representation of this BigInteger that differ from its sign bit.
Examples:
Input: value = 2300 Output: 7 Explanation: Binary signed 2's complement of 2300 = 0000100011111100 Signed bit is 0 because 2300 is positive so no of 1 in 0000100011111100 is bitCount So bitCount in 0000100011111100 = 7 Input: value = 5482549 Output: 11
Below program illustrate the bitCount() method of BigInteger.
/*
*Program Demonstrate bitCount() method of BigInteger
*/
import java.math.*;
public class GFG {
public static void main(String[] args)
{
// Creates BigInteger objects
BigInteger biginteger = new BigInteger("2300");
// Calling bitCount() method on bigInteger
int count = biginteger.bitCount();
String result = "BitCount of " + biginteger + " is " + count;
// Print result
System.out.println(result);
}
}
BitCount of 2300 is 7
Reference : https://docs.oracle.com/javase/7/docs/api/java/math/BigInteger.html#bitCount()
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4