code: function factorize(n, addFactor) {
      let remainder = 0;
      let i = 0;
      let multiplier = FOUND_PRIMES[i];
  
      //go through prime multipliers
      while (multiplier <= n) {
          do {
              remainder = n % multiplier;
              if (!remainder) {
                  n /= multiplier;
                  addFactor(multiplier);
              }
          } while (!remainder);
          multiplier = FOUND_PRIMES[++i];
      }
  }
docs: console.log('4 mOrd 7', mOrder(4, 7, 20)); 
  find prime multipliers of number
  n - number
  addFactor - multiplier processor