For some number y and some divisor x compute the quotient (quotient)^[1] and remainder (remainder) as:

const quotient = Math.floor(y/x);
const remainder = y % x;

Example:

const quotient = Math.floor(13/3); // => 4 => the times 3 fits into 13  
const remainder = 13 % 3;          // => 1

[1] The integer number resulting from the division of one number by another

var answer = Math.floor(x)

I sincerely hope this will help future searchers when googling for this common question.

Is bitwise operation mandatory? There's a much simpler way

const divide = (dividend, divisor) => {
     let quotient = 0, neg = false;

     if( (dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0) ){ neg = true; }

     dividend = Math.abs(dividend);
     divisor = Math.abs(divisor);

     if(dividend < divisor) {return 0;}
     else if(dividend > 0 && divisor != 0){
          while(dividend >= divisor){
               dividend -= divisor;
               ++quotient;
          }
     } else { // handle what you want to do for those cases..}

     return neg ? -quotient : quotient;
}

You get your quotient and remainder is ignored. Just do a check if dividend is negative or divisor is 0.