Program to find whether a given number is power of 2
Last Updated :
12 Mar, 2025
Given a positive integer n, the task is to find if it is a power of 2 or not.
Examples:
Input : n = 16
Output : Yes
Explanation: 24 = 16
Input : n = 42
Output : No
Explanation: 42 is not a power of 2
Input : n = 1
Output : Yes
Explanation: 20 = 1
Approach 1: Using Log - O(1) time and O(1) space
The idea is to use the mathematical property that if a number n is a power of 2, then log2(n) will be an integer. We can compute log2(n) and check if it's an integer by comparing if 2 raised to the power of log2(n) equals n.
C++
// C++ program to find whether
// a given number is power of 2
#include <iostream>
#include <cmath>
using namespace std;
bool isPowerofTwo(int n) {
if (n <= 0)
return false;
// Calculate log base 2 of n
int logValue = log2(n);
// Check if log2(n) is an integer
// and 2^(logn) = n
return pow(2, logValue) == n;
}
int main() {
int n = 16;
if (isPowerofTwo(n)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
// Java program to find whether
// a given number is power of 2
import java.lang.Math;
class GfG {
static boolean isPowerofTwo(int n) {
if (n <= 0)
return false;
// Calculate log base 2 of n
int logValue = (int)(Math.log(n) / Math.log(2));
// Check if log2(n) is an integer
// and 2^(logn) = n
return Math.pow(2, logValue) == n;
}
public static void main(String[] args) {
int n = 16;
if (isPowerofTwo(n)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# Python program to find whether
# a given number is power of 2
import math
def isPowerofTwo(n):
if n <= 0:
return False
# Calculate log base 2 of n
logValue = int(math.log2(n))
# Check if log2(n) is an integer
# and 2^(logn) = n
return pow(2, logValue) == n
if __name__ == "__main__":
n = 16
if isPowerofTwo(n):
print("Yes")
else:
print("No")
// C# program to find whether
// a given number is power of 2
using System;
class GfG {
static bool isPowerofTwo(int n) {
if (n <= 0)
return false;
// Calculate log base 2 of n
int logValue = (int)(Math.Log(n, 2));
// Check if log2(n) is an integer
// and 2^(logn) = n
return Math.Pow(2, logValue) == n;
}
static void Main() {
int n = 16;
if (isPowerofTwo(n)) {
Console.WriteLine("Yes");
} else {
Console.WriteLine("No");
}
}
}
// JavaScript program to find whether
// a given number is power of 2
function isPowerofTwo(n) {
if (n <= 0)
return false;
// Calculate log base 2 of n
let logValue = Math.floor(Math.log2(n));
// Check if log2(n) is an integer
// and 2^(logn) = n
return Math.pow(2, logValue) === n;
}
let n = 16;
if (isPowerofTwo(n)) {
console.log("Yes");
} else {
console.log("No");
}
Approach 2: Using Division and Modulo Operator - O(log n) time and O(1) space
The idea is to repeatedly divide the number by 2 and check if there's any remainder during the process. If n is a power of 2, then dividing it by 2 repeatedly will eventually reduce it to 1 without encountering any odd number in between. If at any point n becomes odd (except for the final value 1), then n is not a power of 2.
C++
// C++ program to find whether
// a given number is power of 2
#include <iostream>
using namespace std;
bool isPowerofTwo(int n) {
if (n <= 0)
return false;
while (n > 1) {
if (n % 2 != 0)
return false;
n = n / 2;
}
return true;
}
int main() {
int n = 16;
if (isPowerofTwo(n)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
// Java program to find whether
// a given number is power of 2
class GfG {
static boolean isPowerofTwo(int n) {
if (n <= 0)
return false;
while (n > 1) {
if (n % 2 != 0)
return false;
n = n / 2;
}
return true;
}
public static void main(String[] args) {
int n = 16;
if (isPowerofTwo(n)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# Python program to find whether
# a given number is power of 2
def isPowerofTwo(n):
if n <= 0:
return False
while n > 1:
if n % 2 != 0:
return False
n = n // 2
return True
if __name__ == "__main__":
n = 16
if isPowerofTwo(n):
print("Yes")
else:
print("No")
// C# program to find whether
// a given number is power of 2
using System;
class GfG {
static bool isPowerofTwo(int n) {
if (n <= 0)
return false;
while (n > 1) {
if (n % 2 != 0)
return false;
n = n / 2;
}
return true;
}
static void Main() {
int n = 16;
if (isPowerofTwo(n)) {
Console.WriteLine("Yes");
} else {
Console.WriteLine("No");
}
}
}
// JavaScript program to find whether
// a given number is power of 2
function isPowerofTwo(n) {
if (n <= 0)
return false;
while (n > 1) {
if (n % 2 !== 0)
return false;
n = Math.floor(n / 2);
}
return true;
}
let n = 16;
if (isPowerofTwo(n)) {
console.log("Yes");
} else {
console.log("No");
}
Approach 3: Using Count of Set Bits - O(log n) time and O(1) space
The idea is to leverage the binary representation of powers of 2, which always have exactly one bit set to 1 (the rest are 0). We can count the number of set bits in the binary representation of n, and if there's exactly one set bit, then n is a power of 2. This works because powers of 2 have the form 2^k, which in binary is a 1 followed by k zeros.
C++
// C++ program to find whether
// a given number is power of 2
#include <iostream>
using namespace std;
bool isPowerofTwo(int n) {
if (n <= 0)
return false;
// Count set bits
int count = 0;
while (n > 0) {
if (n & 1)
count++;
n = n >> 1;
}
// If count of set bits is 1,
// then n is a power of 2
return (count == 1);
}
int main() {
int n = 16;
if (isPowerofTwo(n)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
// Java program to find whether
// a given number is power of 2
class GfG {
static boolean isPowerofTwo(int n) {
if (n <= 0)
return false;
// Count set bits
int count = 0;
while (n > 0) {
if ((n & 1) != 0)
count++;
n = n >> 1;
}
// If count of set bits is 1,
// then n is a power of 2
return (count == 1);
}
public static void main(String[] args) {
int n = 16;
if (isPowerofTwo(n)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# Python program to find whether
# a given number is power of 2
def isPowerofTwo(n):
if n <= 0:
return False
# Count set bits
count = 0
while n > 0:
if n & 1:
count += 1
n = n >> 1
# If count of set bits is 1,
# then n is a power of 2
return count == 1
if __name__ == "__main__":
n = 16
if isPowerofTwo(n):
print("Yes")
else:
print("No")
// C# program to find whether
// a given number is power of 2
using System;
class GfG {
static bool isPowerofTwo(int n) {
if (n <= 0)
return false;
// Count set bits
int count = 0;
while (n > 0) {
if ((n & 1) != 0)
count++;
n = n >> 1;
}
// If count of set bits is 1,
// then n is a power of 2
return (count == 1);
}
static void Main() {
int n = 16;
if (isPowerofTwo(n)) {
Console.WriteLine("Yes");
} else {
Console.WriteLine("No");
}
}
}
// JavaScript program to find whether
// a given number is power of 2
function isPowerofTwo(n) {
if (n <= 0)
return false;
// Count set bits
let count = 0;
while (n > 0) {
if (n & 1)
count++;
n = n >> 1;
}
// If count of set bits is 1,
// then n is a power of 2
return count === 1;
}
let n = 16;
if (isPowerofTwo(n)) {
console.log("Yes");
} else {
console.log("No");
}
Approach 4: Using AND Operator - O(1) time and O(1) space
The idea is to use bit manipulation based on the observation that if n is a power of 2, then its binary representation has exactly one bit set to 1, and n-1 will have all bits to the right of that bit set to 1. Therefore, n & (n-1) will always be 0 for powers of 2. This provides an elegant one-line solution to check if a number is a power of 2 or not.
C++
// C++ program to find whether
// a given number is power of 2
#include <iostream>
using namespace std;
bool isPowerofTwo(int n) {
// Check if n is positive and n & (n-1) is 0
return (n > 0) && ((n & (n-1)) == 0);
}
int main() {
int n = 16;
if (isPowerofTwo(n)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
// Java program to find whether
// a given number is power of 2
class GfG {
static boolean isPowerofTwo(int n) {
// Check if n is positive and n & (n-1) is 0
return (n > 0) && ((n & (n - 1)) == 0);
}
public static void main(String[] args) {
int n = 16;
if (isPowerofTwo(n)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# Python program to find whether
# a given number is power of 2
def isPowerofTwo(n):
# Check if n is positive and n & (n-1) is 0
return (n > 0) and ((n & (n - 1)) == 0)
if __name__ == "__main__":
n = 16
if isPowerofTwo(n):
print("Yes")
else:
print("No")
// C# program to find whether
// a given number is power of 2
using System;
class GfG {
static bool isPowerofTwo(int n) {
// Check if n is positive and n & (n-1) is 0
return (n > 0) && ((n & (n - 1)) == 0);
}
static void Main() {
int n = 16;
if (isPowerofTwo(n)) {
Console.WriteLine("Yes");
} else {
Console.WriteLine("No");
}
}
}
// JavaScript program to find whether
// a given number is power of 2
function isPowerofTwo(n) {
// Check if n is positive and n & (n-1) is 0
return (n > 0) && ((n & (n - 1)) === 0);
}
let n = 16;
if (isPowerofTwo(n)) {
console.log("Yes");
} else {
console.log("No");
}
Approach 5: Using AND & NOT Operator - O(1) time and O(1) space
The idea is to use a bit manipulation technique similar to approach 4, but with a different pattern. When n is a power of 2, it has exactly one bit set to 1. For n-1, all bits to the right of that single set bit will be 1, and the set bit itself will be 0. Taking the NOT of (n-1) flips all these bits, resulting in a number where all bits to the right of the original set bit position will be 0, and all bits to the left (including the bit position itself) will be 1. When we perform n & (~(n-1)), for a power of 2, this operation preserves the original number n because the only set bit in n aligns with a set bit in ~(n-1). For non-powers of 2, this equality doesn't hold.
C++
// C++ program to find whether
// a given number is power of 2
#include <iostream>
using namespace std;
bool isPowerofTwo(int n) {
// Check if n is positive and n & ~(n-1) equals n
return (n > 0) && ((n & (~(n-1))) == n);
}
int main() {
int n = 16;
if (isPowerofTwo(n)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
// Java program to find whether
// a given number is power of 2
class GfG {
// Check if n is positive and n & ~(n-1) equals n
static boolean isPowerofTwo(int n) {
return (n > 0) && ((n & (~(n - 1))) == n);
}
public static void main(String[] args) {
int n = 16;
if (isPowerofTwo(n)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# Python program to find whether
# a given number is power of 2
def isPowerofTwo(n):
# Check if n is positive and n & ~(n-1) equals n
return (n > 0) and ((n & (~(n - 1))) == n)
if __name__ == "__main__":
n = 16
if isPowerofTwo(n):
print("Yes")
else:
print("No")
// C# program to find whether
// a given number is power of 2
using System;
class GfG {
static bool isPowerofTwo(int n) {
// Check if n is positive and n & ~(n-1) equals n
return (n > 0) && ((n & (~(n - 1))) == n);
}
static void Main() {
int n = 16;
if (isPowerofTwo(n)) {
Console.WriteLine("Yes");
} else {
Console.WriteLine("No");
}
}
}
// JavaScript program to find whether
// a given number is power of 2
function isPowerofTwo(n) {
// Check if n is positive and n & ~(n-1) equals n
return (n > 0) && ((n & (~(n - 1))) === n);
}
let n = 16;
if (isPowerofTwo(n)) {
console.log("Yes");
} else {
console.log("No");
}
Similar Reads
Bitwise Algorithms Bitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Introduction to Bitwise Algorithms - Data Structures and Algorithms Tutorial Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0 or 1. In our world, we usually with numbers using the decimal base. In other words. we use the digit 0 to 9 However, there are other number representations that can be quite use
15+ min read
Bitwise Operators in C In C, bitwise operators are used to perform operations directly on the binary representations of numbers. These operators work by manipulating individual bits (0s and 1s) in a number.The following 6 operators are bitwise operators (also known as bit operators as they work at the bit-level). They are
6 min read
Bitwise Operators in Java In Java, Operators are special symbols that perform specific operations on one or more than one operands. They build the foundation for any type of calculation or logic in programming.There are so many operators in Java, among all, bitwise operators are used to perform operations at the bit level. T
6 min read
Python Bitwise Operators Python bitwise operators are used to perform bitwise calculations on integers. The integers are first converted into binary and then operations are performed on each bit or corresponding pair of bits, hence the name bitwise operators. The result is then returned in decimal format.Note: Python bitwis
5 min read
JavaScript Bitwise Operators In JavaScript, a number is stored as a 64-bit floating-point number but bitwise operations are performed on a 32-bit binary number. To perform a bit-operation, JavaScript converts the number into a 32-bit binary number (signed) and performs the operation and converts back the result to a 64-bit numb
5 min read
All about Bit Manipulation Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementa
14 min read
What is Endianness? Big-Endian & Little-Endian Computers operate using binary code, a language made up of 0s and 1s. This binary code forms the foundation of all computer operations, enabling everything from rendering videos to processing complex algorithms. A single bit is a 0 or a 1, and eight bits make up a byte. While some data, such as cert
5 min read
Bits manipulation (Important tactics) Prerequisites: Bitwise operators in C, Bitwise Hacks for Competitive Programming, Bit Tricks for Competitive Programming Table of Contents Compute XOR from 1 to n (direct method)Count of numbers (x) smaller than or equal to n such that n+x = n^xHow to know if a number is a power of 2?Find XOR of all
15+ min read
Easy Problems on Bit Manipulations and Bitwise Algorithms
Binary representation of a given numberGiven an integer n, the task is to print the binary representation of the number. Note: The given number will be maximum of 32 bits, so append 0's to the left if the result string is smaller than 30 length.Examples: Input: n = 2Output: 00000000000000000000000000000010Input: n = 0Output: 000000000000
6 min read
Count set bits in an integerWrite an efficient program to count the number of 1s in the binary representation of an integer.Examples : Input : n = 6Output : 2Binary representation of 6 is 110 and has 2 set bitsInput : n = 13Output : 3Binary representation of 13 is 1101 and has 3 set bits[Naive Approach] - One by One CountingTh
15+ min read
Add two bit stringsGiven two binary strings s1 and s2 consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings.Note: The input strings may contain leading zeros but the output string should not have any leading zeros.Examples:Input: s1 = "1101", s2 = "111"Output: 10100Explanation: "1
1 min read
Turn off the rightmost set bitGiven an integer n, turn remove turn off the rightmost set bit in it. Input: 12Output: 8Explanation : Binary representation of 12 is 00...01100. If we turn of the rightmost set bit, we get 00...01000 which is binary representation of 8Input: 7 Output: 6 Explanation : Binary representation for 7 is 0
7 min read
Rotate bits of a numberGiven a 32-bit integer n and an integer d, rotate the binary representation of n by d positions in both left and right directions. After each rotation, convert the result back to its decimal representation and return both values in an array as [left rotation, right rotation].Note: A rotation (or cir
7 min read
Compute modulus division by a power-of-2-numberGiven two numbers n and d where d is a power of 2 number, the task is to perform n modulo d without the division and modulo operators.Input: 6 4Output: 2 Explanation: As 6%4 = 2Input: 12 8Output: 4Explanation: As 12%8 = 4Input: 10 2Output: 0Explanation: As 10%2 = 0Approach:The idea is to leverage bi
3 min read
Find the Number Occurring Odd Number of TimesGiven an array of positive integers. All numbers occur an even number of times except one number which occurs an odd number of times. Find the number in O(n) time & constant space. Examples : Input : arr = {1, 2, 3, 2, 3, 1, 3}Output : 3 Input : arr = {5, 7, 2, 7, 5, 2, 5}Output : 5 Recommended
12 min read
Program to find whether a given number is power of 2Given a positive integer n, the task is to find if it is a power of 2 or not.Examples: Input : n = 16Output : YesExplanation: 24 = 16Input : n = 42Output : NoExplanation: 42 is not a power of 2Input : n = 1Output : YesExplanation: 20 = 1Approach 1: Using Log - O(1) time and O(1) spaceThe idea is to
12 min read
Find position of the only set bitGiven a number n containing only 1 set bit in its binary representation, the task is to find the position of the only set bit. If there are 0 or more than 1 set bits, then return -1. Note: Position of set bit '1' should be counted starting with 1 from the LSB side in the binary representation of the
8 min read
Check for Integer OverflowGiven two integers a and b. The task is to design a function that adds two integers and detects overflow during the addition. If the sum does not cause an overflow, return their sum. Otherwise, return -1 to indicate an overflow.Note: You cannot use type casting to a larger data type to check for ove
7 min read
Find XOR of two number without using XOR operatorGiven two integers, the task is to find XOR of them without using the XOR operator.Examples : Input: x = 1, y = 2Output: 3Input: x = 3, y = 5Output: 6Approach - Checking each bit - O(log n) time and O(1) spaceA Simple Solution is to traverse all bits one by one. For every pair of bits, check if both
8 min read
Check if two numbers are equal without using arithmetic and comparison operatorsGiven two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The idea is to use XOR operator. XOR of two numbers is 0 if the numbers are the same, otherwise non-zero. C++ // C++ program to check if two numbers // a
8 min read
Detect if two integers have opposite signsGiven two integers a and b, the task is to determine whether they have opposite signs. Return true if the signs of the two numbers are different and false otherwise.Examples:Input: a = -5, b = 10Output: trueExplanation: One number is negative and the other is positive, so their signs are different.I
9 min read
Swap Two Numbers Without Using Third VariableGiven two variables a and y, swap two variables without using a third variable. Examples: Input: a = 2, b = 3Output: a = 3, b = 2Input: a = 20, b = 0Output: a = 0, b = 20Input: a = 10, b = 10Output: a = 10, b = 10Table of ContentUsing Arithmetic OperatorsUsing Bitwise XORBuilt-in SwapUsing Arithmeti
6 min read
Russian Peasant (Multiply two numbers using bitwise operators)Given two integers a and b, the task is to multiply them without using the multiplication operator. Instead of that, use the Russian Peasant Algorithm.Examples:Input: a = 2, b = 5Output: 10Explanation: Product of 2 and 5 is 10.Input: a = 6, b = 9Output: 54Explanation: Product of 6 and 9 is 54.Input:
4 min read