Perfect number printer (recursive)

public class PerfectNumber {

    private boolean isPerfectNumber(int number, int current, int sum) {

        if (number <= 2) {
            return false;
        }

        if (current == 1) {
            return ++sum == number;
        }

        if (number % current == 0) {
            return isPerfectNumber(number, current - 1, sum + current);
        } else {
            return isPerfectNumber(number, current - 1, sum);
        }
    }

    public boolean perfectNumber(int n) {
        return isPerfectNumber(n, n / 2, 0);
    }


    public static void main(String[] args) {
        PerfectNumber pNumber = new PerfectNumber();

        for (int i = 1; i < 10000; i++) {
            if (pNumber.perfectNumber(i)) {
                System.out.println(i + " is a perfect number!");
            }
        }
    }
}