List prime factors

Primes.java

package primes;

/**
 * ConsoleApp by Tarun Boddupalli
 * <p>
 * The MIT License (MIT)
 * <p>
 * Copyright (c) 2015 Tarun Boddupalli
 * <p>
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * <p>
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 * <p>
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
import java.util.List;
import java.util.ArrayList;
import java.util.stream.Collectors;

public class Primes {

    public static void main(String[] args) {
        System.out.println(listFactors(12));
        System.out.println(isPrime(156));
        System.out.println(isPrime(71));
        System.out.println(listPrimeFactors(12));
    }

    public static List<Integer> listFactors(int n) {
        if (n < 2) throw new IllegalArgumentException("Number must be greater than 2.");
        List<Integer> factors = new ArrayList<Integer>();
        for (int i = 2; i < n; i++) {
            if (n % i == 0) factors.add(i);
        }
        return factors;
    }

    public static boolean isPrime(int n) {
        if (n < 2) throw new IllegalArgumentException("Number must be greater than 2.");
        for (int i = 2; i < n; i++) {
            if (n % i == 0) return false;
        }
        return true;
    }

    public static List<Integer> listPrimeFactors(int n)  {
        return listFactors(n).stream().filter(Primes::isPrime).collect(Collectors.toList());
    }
}