static TreeSet<Long> findPrimeFactors(long value) {
		TreeSet<Long> factors = new TreeSet<>();
		for(long i = 2; i <= value; i++) {
			if(isPrime(i)) {
				if(evenlyDivisible(value, i)) {
					factors.add(i);
					value = value / i;
					factors.addAll(findPrimeFactors(value));
				}
			}
		}
		return factors;
	}