BigInteger setBit() Method in Java

The java.math.BigInteger.setbit(index) method returns a Big-integer whose value is equivalent to this Big-integer with the designated bit set. The method computes (this | (1<<n)). The bit at index n of binary representation of Big-integer will be set means converted to 1.


public BigInteger setbit(int n)

Parameters: The method takes one parameter n which refers to the index of the bit that is needed to be set.

Return Value: The method returns the BigInteger value after setting the bit position n.

Exceptions: The method might throw an ArithmeticException when n is negative.


Input: value = 2300 index = 1
Output: 2302
Binary Representation of 2300 = 100011111100
bit at index 3 is 1 so set the bit at index 1 
Now Binary Representation becomes 100011111110
and Decimal equivalent of 100011111110 is 2302

Input: value = 5482549 index = 1
Output: 5482551

Below program illustrate the setBit(index) method of BigInteger:





// Program to demonstrate setBit() method of BigInteger 
import java.math.*;
public class GFG {
    public static void main(String[] args)
        // Creating BigInteger object
        BigInteger biginteger = new BigInteger("2300");
        // Creating an integer i for index
        int i = 1;
        // Calling setBit() method on bigInteger at index i
        // store the return BigInteger
        BigInteger changedvalue = biginteger.setBit(i);
        String result = "After applying setBit at index "
        i + " of " + biginteger+ " New Value is " + changedvalue;
        // Displaying the result



After applying setBit at index 1 of 2300 New Value is 2302


Attention reader! Don’t stop learning now. Get hold of all the important Java and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

I am a Developer I love to code and bring my ideas alive

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.