public static boolean isPrime(long number) {
		if (number < 2)
			return false;
		if (number < 4)
			return true;
		if (number % 2 == 0)
			return false;
		if (number < 9)
			return true;
		if (number % 3 == 0)
			return false;
		int sqrt = (int) Math.sqrt(number);
		for (long i = 5; i <= sqrt; i = i + 6) {
			if (number % i == 0 || number % (i + 2) == 0)
				return false;
		}
		return true;
	}