Impossible Cryptarithm - (Part 2)

$\Large \overline{ABC} \times \overline{DE} = \overline{FG} \times \overline{HI} = X$

If $A,B,C,D,E,F,G,H,I$ are distinct positive digits , find the minimum value of $X$ .

This problem is a part of this set (click here) .