Let kk be the number of digits, and let aa be the first digit (assume a>0a>0). Then the product of the digits is bounded above by a×9k−1a×9k−1. The value of the number itself is bounded below by the total value of that first digit: a×10k−1a×10k−1. ( Change all the a's to n's )