The remainder obtained when $1! + 2! + 3! + \ldots + 11!$ is divided by $12$ is

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is

The number of $5$-digit numbers that are not divisible by $5$ and consist of different odd digits is:

An envelope has space for at most $3$ stamps. If you are given three stamps of denomination $1$ and three stamps of denomination $a$ (where $a > 1$),what is the least positive integer for which there is no possible stamp value?

Let $5$-digit numbers be constructed using the digits $0, 2, 3, 4, 7, 9$ with repetition allowed,and are arranged in ascending order with serial numbers. Then the serial number of the number $42923$ is $...............$.

If all the letters of the word $COMBINATION$ are arranged in all possible ways to form $11$ letter words (with or without meaning),then the number of words among them in which $C$ and $N$ occupy the end positions and no vowel appears exactly in the middle position is