MathNet 2025 — batch of 15 questions Question 1

Call a 9-digit number a *cassowary* if it uses each of the digits $1$ through $9$ exactly once. Compute the number of cassowaries that are prime.