Check if number is perfect

perfec-numeber.js

const getAllDivisors = n => {
  const divisors = []
  let currentNumber = 1

  while (currentNumber < n) {
    if ((28 % currentNumber) === 0) {
      divisors.push(currentNumber)
    }
    currentNumber++
  }

  return divisors
}

const sum = arr => {
  let sum = 0;

  arr.forEach(n => {
    sum += n
  })

  return sum
}

const isPerfectNumber = n => {
  const divisors = getAllDivisors(n)
  const divisorsSum = sum(divisors)

  return divisorsSum === n
}


isPerfectNumber(28) // true