A perfect number is a positive integer that is equal to the sum of its divisors (excluding itself).
The program should read in a number input and use a for loop to iterate through all the divisors of the number, summing them. After that, the program should compare the sum to the number itself. If the sum is equal to the number, then it is a perfect number.
You can use the first 5 perfect numbers to test if your program is correct: 6, 28, 496, 8128 and 33550336.