# Find value of k-th bit in binary representation

Given a number n and k (1 <= k <= 32), find value of k-th bit in binary representation of n. Bits are numbered from right (Least Significant Bit) to left (Most Significant Bit).

Examples :

```Input :  n = 13, k = 2
Output : 0
Binary representation of 13 is 1101.
Second bit from right is 0.

Input :  n = 14, k = 3
Output : 1
Binary representation of 14 is 1110.
Third bit from right is 1.
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

1) Find a number with all 0s except k-th position. We get this number using ( 1 << (k-1) ). For example if k = 3, then ( 1 << 2) gives us (00..00100).
2) Do bitwise and of above obtained number with n to find if k-th bit in n is set or not.

## C++

 `// CPP program to find k-th bit from right ` `#include ` `using` `namespace` `std; ` ` `  `void` `printKthBit(unsigned ``int` `n, unsigned ``int` `k) ` `{ ` `     ``cout << (n & (1 << (k-1))); ` `} ` ` `  `int` `main() ` `{ ` `  ``unsigned ``int` `n = 13, k = 2; ` `  ``printKthBit(n, k); ` `  ``return` `0; ` `} `

## Java

 `// Java program to find ` `// k-th bit from right ` `import` `java.io.*; ` ` `  `class` `GFG  ` `{ ` `    ``static` `void` `printKthBit(``long` `n, ``long` `k) ` `    ``{ ` `    ``System.out.println( (n & (``1` `<< (k - ``1``)))); ` `    ``} ` ` `  ` `  `// Driver Code ` `public` `static` `void` `main (String[] args) ` `{ ` `    ``long` `n = ``13``, k = ``2``; ` `    ``printKthBit(n, k); ` `} ` `} ` ` `  `// This code is contributed by anuj_67. `

## Python3

 `# Python 3 program to find  ` `# k-th bit from right ` `def` `printKthBit(n, k): ` ` `  `    ``print``(n & (``1` `<< (k``-``1``))) ` ` `  `n ``=` `13` `k ``=` `2` `printKthBit(n, k) ` ` `  `# This code is contributed  ` `# by Smitha `

## C#

 `// C# program to find k-th bit from right ` `using` `System; ` ` `  `class` `GFG { ` `     `  `    ``static` `void` `printKthBit(``long` `n, ``long` `k) ` `    ``{ ` `        ``Console.WriteLine( (n & (1 <<  ` `                            ``(``int``)(k - 1)))); ` `    ``} ` ` `  `    ``// Driver Code ` `    ``public` `static` `void` `Main () ` `    ``{ ` `        ``long` `n = 13, k = 2; ` `         `  `        ``printKthBit(n, k); ` `    ``} ` `} ` ` `  `// This code is contributed by anuj_67. `

## PHP

 ` `

Output :

```0
```

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.

Improved By : vt_m, Smitha Dinesh Semwal

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}