与えられた個数の質数の和を求める

public class Test {
    
    /**
     * @Description Get after a specified number of the first prime Numbers
     * @param num a specified number
     * @return int
     * @throws
     */
    public int getAfterSpecifiedNumOfTheFirstPrimeNum(int num) {
        int beginNum = num;
        if (beginNum == 0) {
            beginNum = 1;
        }
        for (int i = (beginNum + 1);; i++) {
            if (isPrimeNum(i)) {
                return i;
            }
        }
    }
    
    /**
     * @Description  
     * @param num
     * @return boolean
     * @throws
     */
    private boolean isPrimeNum(int num) {
        if (num < 2) {
            return false;
        }
        for (int i = 1; i < num; i++) {
            if (num % i == 0 && i != 1) {
                return false;
            }
        }
        return true;
    }
    
    /**
     * @Description  
     * @param num
     * @return int
     */
    public int getContPrimeNum(int num) {
        int sum = 0;
        int primeNum = 0;
        for (int i = 0; i < num; i++) {
            primeNum = getAfterSpecifiedNumOfTheFirstPrimeNum(primeNum);
            sum += primeNum;
        }
        return sum;
    }
    
    public static void main(String[] args) {
        Test t = new Test();
        System.out.println(t.getContPrimeNum(7));
    }
}