LeetCode 507. Perfect Number

We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.

Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.
Example:
Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14

class Solution {
public:
    bool checkPerfectNumber(int num) {
        if(num == 1) {return false; }
        int start_at = 2;
        int sum = 1;
        while( start_at < (num / start_at) ){
            if (num % start_at == 0){
                sum += start_at + num / start_at;
            }
            start_at *= 2;
        }
        bool result = sum == num ? true : false;
        return result;
    }
};