Complement of Base 10 Integer LeetCode solution in JavaScript

1
var bitwiseComplement = function (n) {
2
  let xor = 0b1;
3
  let copy = Math.floor(n / 2);
4
  while (copy > 0) {
5
    xor = (xor << 1) + 1;
6
    copy = Math.floor(copy / 2);
7
  }
8

9
  return n ^ xor;
10
};