Not too nice ticks for big domains about d3-scale HOT 3 CLOSED

// Problem
r0 + i * step;
0 + 3 * 2e+23; // This returns 5.9999999999999995e+23

Big(2e+23).mul(3).toString(); // 6e+23 Nice result !!

function ticks(start, stop, count) {
  var reverse,
      i = -1,
      n,
      ticks,
      step;

  stop = +stop, start = +start, count = +count;
  if (start === stop && count > 0) return [start];
  if (reverse = stop < start) n = start, start = stop, stop = n;
  if ((step = tickIncrement(start, stop, count)) === 0 || !isFinite(step)) return [];

  if (step > 0) {
    let r0 = Math.round(start / step), r1 = Math.round(stop / step);
    console.log(start, stop, step)
    console.log(r0, r1)
    if (r0 * step < start) ++r0;
    console.log(r0, r1)
    if (r1 * step > stop) --r1;
    console.log(r0, r1)
    ticks = new Array(n = r1 - r0 + 1);
    console.log(ticks, n)
    while (++i < n) ticks[i] = Number(Big(r0).add(i).mul(step).toString());
  } else {
    step = -step;
    let r0 = Math.round(start * step), r1 = Math.round(stop * step);
    if (r0 / step < start) ++r0;
    if (r1 / step > stop) --r1;
    ticks = new Array(n = r1 - r0 + 1);
    while (++i < n) ticks[i] = Number(Big(r0).add(i).div(step).toString());
  }

  if (reverse) ticks.reverse();

  return ticks;
}