public static BigInteger getPrimeMultiples(int n, int B) {
		BigInteger result = ONE;

		for (int num = 2; num < B; ++num) {
			boolean isPrime = true;

			for (int i = 2; i < num; ++i) {
				if ((num % i) == 0) {
					isPrime = false;

					break;
				}
			}

			if (isPrime) {
				// multiply result by num^n
				BigInteger temp = new BigInteger(Integer.toString(num));
				temp       = temp.pow(n);
				result     = result.multiply(temp);
			}
		}

		return result;
	}