Correct Answer: 151200

When all the S are taken together, then AS^AS^INATION are letters.

So, 10 letters in the total can be arranged in 10 ways.

All S are considered as 1

But here are 3 'A' and 2 'I' and 2 'N'.

The required number of ways = \( \large\frac{10!}{3! \times 2! \times 2!} = 151200 \)