Check Perfect Number Using Recursion

PerfectNumber.java

/*
Write a program to accept a number
and print the number is a perfect number or not using a recursion
and print the result. 

INPUT:  6
OUTPUT: 6 is a perfect number
*/

import java.util.Scanner;

class PerfectNumber {

    int sum = 0;

    boolean isPerfect(int n, int i) {
        if (i == n) {
            if (sum == n)
                return true;
            else
                return false;
        }

        if (n % i == 0)
            sum += i;

        return (isPerfect(n, i + 1));
    }

    public static void main(String[] args) {
        PerfectNumber perfectNumber = new PerfectNumber();
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter a number");

        if (perfectNumber.isPerfect(sc.nextInt(), 1))
            System.out.println("Number is a perfect number");
        else
            System.out.println("Number is not a perfect number");
    }
}