sumPrimes scrimba coding challange

sumPrimes.js

//function sumPrimes sums all prime numbers up to the provided number

const isPrime = function (number) {
  if (number <= 2) {
    return 1;
  }
  for (let i = 2; i < number; i++) {
    if (number % i === 0) {
      return 0;
    }
  }
  return 1;
};

const sumPrimes = function (num) {
  sum = 0;
  for (i = 2; i <= num; i++) {
    if (isPrime(i)) {
      sum += i;
    }
  }
  return sum;
};

console.log(sumPrimes(977));