Test Quality Of Number

Write a Java program that reads a positive, non-zero integer as input and checks if the integer is deficient, perfect, or abundant.A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors (i.e., the positive integers, other than N itself, that divide N exactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. If the sum is greater than N, the number is said to be abundant.

For example, the number 6 is perfect, since 6 = 1 + 2 + 3, the number 8 is deficient, since 8 > 1 + 2 + 4, while the number 12 is abundant, since 12 < 1 + 2 + 3 + 4 + 6.

Sample Output:

Input N: 5

5 is deficient.

Input N: 6

6 is perfect.

Input N: 18

18 is abundant.