Javascript cartesian product (power set) using bits

cartesian.js

const input = 'abc'
const inputLength = 3
const powerSetSize = Math.pow(2, inputLength)

let result = []

for (let k = 0; k < powerSetSize; k++) {
  let set = "";
  let binaryDigits = k;
  for (let j = 0; j < inputLength; j++) {
    if (binaryDigits % 2 == 1) {
      set += input.charAt(j);
    }
    binaryDigits >>= 1;
  }
  result[k] = set;
}

console.log(result)