BigInteger and() Method in Java

The java.math.BigInteger.and(BigInteger val) method returns a BigInteger whose value is bitwise-AND of two BigIntegers. This method returns a negative number if both of the BigIntegers are negative. The and() method applies bitwise-AND operation upon the current bigInteger and bigInteger passed as parameter.


public BigInteger and(BigInteger val)

Parameters: The method accepts one parameter val of BigInteger type and refers to the value to be AND’ed with the current BigInteger.

Return Value: The method returns the value of bitwise-AND of two BigIntegeres.


Input: value1 = 2300, value2 = 3400
Output: 2120
Binary of 2300 = 100011111100
Binary of 3400 = 110101001000
AND of 100011111100 and 110101001000 = 100001001000
Decimal of 100001001000 = 2120.

Input: value1 = 432045, value2 = 321076
Output: 296484

Below program is used to illustrate the and() method of BigInteger.





*Program Demonstrate and() method of BigInteger 
import java.math.*;
public class GFG {
    public static void main(String[] args)
        // Creates 2 BigInteger objects
        BigInteger biginteger = new BigInteger("2300");
        BigInteger val = new BigInteger("3400");
        // Call and() method to find this & val
        BigInteger biggerInteger = biginteger.and(val);
        String result = "Result of AND operation between " + biginteger + " and "
                        + val + " is " + biggerInteger;
        // Print the result



Result of AND operation between 2300 and 3400 is 2120


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.