Perfect number finder

PerfectNumberFinder.java

public class PerfectNumberFinder {
    public static boolean isPerect(int number) {
        // get factors
        List<Integer> factors = new ArrayList<Integer>();
        factors.add(1);
        factors.add(number);
        for (int i = 2; i < Matj.sqrt(number); i++) {
            if (number % i == 0) {
                factors.add(i);
                if (number / i != i) {
                    factors.add(number / i);
                }
            }
        }

        // sum the factors
        int sum = 0;
        for (Integer i : factors) {
            sum += i;
        }

        // if it's perfect number?
        return sum - number == number;
    }
}