private boolean isPrime(Integer number) {
		
		if ( (number > 2 && number % 2 == 0) || number < 2) {
			return false;
		}
		
		for (long i = 3; i <= Math.sqrt(number); i += 2) {
			if (number % i == 0) {
				return false;
			}
		}
		return true;
	}