1
class Solution:
2
def checkPerfectNumber(self, num: int) -> bool:
3
sum = 0
4
root = num**0.5
5
if num == 1:
6
return False
7
for i in range(2, int(root) + 1):
8
if num % i == 0:
9
sum += (num // i) + i
10
return sum + 1 == num

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0