public static Map<Integer, Integer> factorization(int number) {
		final Map<Integer, Integer> result = new HashMap<Integer, Integer>();
		for (int i = 2; i <= number; i++) {
			if (!Primes.isPrime(i)) {
				continue;
			}
			int prime = i;
			if (prime <= number) {
				int tmp = number;
				int count = 0;
				while (tmp % prime == 0) {
					count++;
					tmp = (int) (tmp / prime);
				}
				if (count > 0) {
					result.put(prime, count);
				}
			}
		}
		return result;
	}