public static Map<Integer, Integer> getPrimeFactorisation(int number) {
        Map<Integer, Integer> primes = new HashMap<>();
        if (number == 1) {
            primes.put(2, 0);
        }
        for (int prime = 2; number != 1; prime++) {
            int count = 0;
            while (number % prime == 0) {
                count++;
                number /= prime;
            }
            if (count != 0) {
                primes.put(prime, count);
            }
        }
        return primes;
    }