private boolean isPrime(long pNumber){
		boolean check = false;
		long n = pNumber;
		for(long i : primes ){
			if(i > Math.sqrt(n)){
				break;
			}
			while (n%i == 0) {
				n /= i;
				break;
			}
		}
		if(pNumber == n){
			check = true;
		}
		return check;
	}