Let's say a number $n$ is insertable if for every digit $d$, if we insert $d$ between any two digits of $n$, then the obtained number is a multiple of $d$. For example, $144$ is not insertable because $1474$ is not divisible by $7$.
The question is the find the smallest insertable positive integer with at least two digits.
It is relatively easy to see that such a number have to be divisible by $2520$ (assuming it is at least $4$-digits long). I also ran a script to check all integers below 75,000,000,000 with no success (the issue might be my code).
Disclaimer. I do not know if such a number do exist.
Let $a_m....a_1a_0$ be any insertable number. Then, for each digit $d$ we must have $$a_m..a_kda_{k-1}..a_0$$ is a multiple of $d$.
In particular, $$d| a_m..a_kda_{k-1}..a_0-a_m..a_ka_{k-1}d..a_0=10^{k-1}9(d-a_k)$$
Since $7$ is the only digit relatively prime with $10$ and $9$, we should concentrate on $d=7$.
$d=7$ implies that $a_k=0,7$ for all $k$.
Next, $d=9$ implies that the number must contain at least 9 sevens. Since it must end in $000$ the smallest possible example is indeed $777777777000$.
P.S. The above shows that any insertable number must have all digits $0$ and $7$, contain a multiple of $9$ number of $7$'s and end in three 0's. It is easy to check if the converse is also true, I think it is but I am too lazy :D