Perfect Number Python Solution with Tests

lcpy gen -n 507   # by problem number
lcpy gen -s perfect_number   # by problem name

Input: num = 28
Output: true
Explanation: 28 = 1 + 2 + 4 + 7 + 14
1, 2, 4, 7, and 14 are all divisors of 28.

Input: num = 7
Output: false

class Solution:
    # Time: O(sqrt(n))
    # Space: O(1)
    def check_perfect_number(self, num: int) -> bool:
        if num <= 1:
            return False
        total = 1
        i = 2
        while i * i <= num:
            if num % i == 0:
                total += i
                paired = num // i
                if paired != i:
                    total += paired
            i += 1
        return total == num