# Leetcode 507 - Perfect number

`Note:`

- Remember to get all divisors, just search between
`[sqrt(n), n]`

.

`Question:`

A `perfect number`

is a `positive integer`

that is equal to the sum of its positive divisors, excluding the number itself. A divisor of an integer `x`

is an integer that can divide `x`

evenly.

Given an integer `n`

, return `true`

if `n`

is a perfect number, otherwise return `false`

.

`Example:`

1 | Input: num = 28 |

`Code:`

1 | /** |