public static int findClosestPrimeNumber(int number) {
		int previous = 0;
		int next = 0;

		for (int i = 0; i < 10; i++) {
			previous = i;
			next = i + 1;

			if (PRIME_NUMBERS[0] == number)
				break;

			if (PRIME_NUMBERS[previous] == number)
				previous--;

			if (PRIME_NUMBERS[next] == number)
				next++;

			if (PRIME_NUMBERS[previous] < number
					&& PRIME_NUMBERS[next] > number) {
				int rangeDown = Math.abs(PRIME_NUMBERS[previous] - number);
				int rangeUp = Math.abs(PRIME_NUMBERS[next] - number);
				if (rangeDown < rangeUp)
					return PRIME_NUMBERS[previous];
				else
					return PRIME_NUMBERS[next];
			}

		}

		return number * 2 + 1;
	}