perfect number

perfect.coffee

isDivider = (n, d)-> n % d is 0
maxDivider = (i)-> parseInt(Math.sqrt(i))

sumOfDividers = (n)->
  sum = 1;

  i = 2
  while i <= maxDivider(n)
    if isDivider(n, i)
      sum += i
      sum += reverse if (reverse = parseInt(n / i)) isnt i
    i++
  sum

isPerfect = (i)->
  return false if i < 6
  return sumOfDividers(i) is i;

next = (i)-> i+1

findPerfect = (number, i=0)->
  return 6 if number is 1

  while true
    if isPerfect(i)
      number--
      return i if number is 0
    i=next(i)