Consecutive Numbers Sum LeetCode solution in JavaScript

1
var consecutiveNumbersSum = function (n) {
2
  let count = 1;
3
  for (
4
    let numberOfTerms = 2;
5
    numberOfTerms < Math.sqrt(2 * n) + 1;
6
    numberOfTerms++
7
  ) {
8
    let startNumber =
9
      (n - (numberOfTerms * (numberOfTerms - 1)) / 2) / numberOfTerms;
10
    if (Number.isInteger(startNumber) && startNumber !== 0) {
11
      count++;
12
    }
13
  }
14
  return count;
15
};