If is the smallest positive integer whose digits have a product of 2700, what is the sum of the digits of ?
Solution
In order to find , which is the smallest possible integer whose digits have a fixed product, we must first find the minimum possible number of digits with this product. Once we have determined the digits that form , then the integer itself is formed by writing the digits in increasing order. Note that the digits of cannot include 0, or else the product of its digits would be 0. Also, the digits of cannot include 1, otherwise we could remove the 1s and obtain an integer with fewer digits (thus, a smaller integer) with the same product of digits. Since the product of the digits of is 2700, we find the prime factorization of 2700 to help us determine what the digits are: . In order for a non-zero digit to have a factor of 5, then the digit must equal 5. Since 2700 has two factors of 5, then the digits of includes two 5s. The remaining digits have a product of . Therefore, we must try to find a combination of the smallest number of possible digits whose product is 108. We cannot have 1 digit with a product of 108. We also cannot have a 2 digits with a product of 108, as the product of 2 digits is at most . We can have a product of 3 digits with a product of 108 (for example, or ). Therefore, the number has 5 digits (two 5s and three other digits with a product of 108). In order for to be as small as possible, its leading digit (that is, its ten thousands digit) must be as small as possible. Recall that cannot include the digit 1. The next smallest possible leading digit is 2. In this case, 2 must be one of the three digits whose product is 108. Thus, the remaining two of these three digits have a product of , and so must be 6 and 9. Therefore, the digits of must be . The smallest possible number formed by these digits is when the digits are placed in increasing order, and so . The sum of the digits of is .