Prime numbers algorythm

primeNumbers.js

function getPrimeNumbers(n) {

  var arr = [];

  for(var i = 2; i <= n; i++) {
    for(var k = 2; k <= i; k++) {
      if (i === k) arr.push(i);
      if (i % k === 0) break;
    }
  }

  return arr;

}

function getSumm(arr) {
  return arr.reduce(function(p, c){
    return p + c;
  });
}

var primeNumebrs = getPrimeNumbers(100);

console.clear();
console.log('Prime numbers are: ' + primeNumebrs);
console.log('Summ is: ' + getSumm(primeNumebrs));