def get_prime_factorization(number):
    """Create a dictionary containing the provided number's prime factorization."""
    prime_factorization = {}
    # Inline sieve of Erastothenes; starting at 2 ensures factors will only be prime.
    for factor in range(2, number + 1):
        if number % factor == 0:
            # Record the number of times this factor is contained in the number.
            exponent = 0
            while number % factor == 0:
                number /= factor
                exponent += 1

            prime_factorization[factor] = exponent

            # Check if we've factored the number completely.
            if number == 1:
                return prime_factorization