# Inspired to share a problem again.

**Number Theory**Level 5

Find all 10 digit numbers using each of the digits \((0-9)\) once, such that the first \(n\) digits form a number divisible by \(n\) (for \(n \in \{1,2,\ldots ,10\}\)?

Enter your answer as the sum of all such possible.