A four digit positive number having all non-zero distinct digits is such that the product of all the digits is least. If the difference of hundreds digit and tens digit is 1.
How many possibilities are there of such number?

Using the digits 1 up to 9, two numbers must be made.
The product of these two numbers should be as large as possible.
All digits must be used exactly once.
Which are the requested two numbers?