# What is the least positive integer that is divisorous?

We say that a positive integer $N$ is divisorous if the ones digits of the positive divisors of $N$ include all of the base-ten digits from $0$ to $9$. What is the least positive integer that is divisorous?

I didn't see an easy way of finding the least such $N$. We know that $N$ must contain a factor of $2$ and $5$, but how do we find the least such $N$?

• "divisorous", Jurassic Park in mathematics... – Jean Marie Dec 27 '16 at 19:14
• 24 is very good i think. Something bigger about 24 ? – ninjaaa Dec 27 '16 at 19:14
• Once you know $N$ is divisible by $10$, a brute-force search is easy. – Robert Israel Dec 27 '16 at 19:19
• 2520 is an upper bound. – Fabio Somenzi Dec 27 '16 at 19:21

## 2 Answers

$2\cdot 3^3\cdot 5=270$.

From 1,3,5,$3^3=27$, and $3^2=9$, we get all the odd digits, and multiplying by two, we get all the even ones. We can see that all the prime factors here are necessary, and by minimality of the prime factors in question, we cannot get a smaller one.

• I wrote a python search that agrees with this. – Mark Dec 27 '16 at 19:26
• Why is $3$ necessary? For example, $1330 = 2 \cdot 5 \cdot 7 \cdot 19$ is divisorous. – Robert Israel Dec 27 '16 at 19:37
• @Robert: By necessary, I meant necessary for this example to be divisorous, not that it is necessary for any divisorous number. – CZiegler Dec 27 '16 at 20:14

We first see that such an $N$ must be a multiple of $2$ since otherwise the units digits of the divisors would never be even. We also see that $N$ must be a multiple of $5$ since any number which has a units digit of $5$ must be a multiple of $5$. Thus $N$ is a multiple of $10$ and so we may write $$N = 2 \cdot 5k$$ for some positive integer $k$. Now we take two cases:

Case $1$: $3 \mid N$

In this case we prove that the minimal $N = 2 \cdot 3^3 \cdot 5$. If the exponent of $3$ is reduced, then the new prime $7$ must be added to the prime factorization of $N$ and so $3^2 \nmid N$ otherwise $N$ would be larger. But then we have the minimal such $N$ to be $2 \cdot 3 \cdot 5 \cdot 7$, which doesn't have a divisor with a units digit of $9$. Thus the exponent of $3$ cannot be reduced and so $N$ is minimal in this case.

Case $2$: $3 \nmid N$

In this case we prove that $N > 2 \cdot 3^3 \cdot 5$. We must add a new prime greater than or equal to $7$ into the prime factorization of $2 \cdot 5$. We also must add at least one other prime since otherwise we will have exactly $8$ divisors and it can't be $2$ since we can't get a units digit of $8$. Thus we have $N \geq 2 \cdot 5^2 \cdot 7$, which means that $N > 2 \cdot 3^3 \cdot 5$ since $7 \cdot 5 > 3^3$.