An integer number is said to be a perfect number if its factors, including 1 (but not the number itself) sum to the number. For example, 6 is a perfect number, because 6 = 1 + 2 + 3. (The factorization of 6 is 1*2*3, so the sum of the factors of the number 6 is 6). Write a method perfect that determines whether a parameter number is a perfect number. Use this method in an application that determines and displays all perfect numbers between 1 and 1000. Challenge the computing power of your computer by testing numbers much larger than 1000. Display the results