public long sumPrimesBelow(int num) {
		long sum = 2l;  // Make sum a long - integer limit is ~2 billion, not enough
		for (int i = 3; i < num; i++) {
			if (isPrime(i)) {
				sum += (long) i;
			}
		}
		return sum;
	}