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 total number of $5$-digit numbers, formed by using the digits $1, 2, 3, 5, 6, 7$ without repetition, which are multiples of $6$, is

$A$ man has $7$ relatives,$4$ of them are ladies and $3$ are gents; his wife has $7$ other relatives,$3$ of them are ladies and $4$ are gents. The number of ways they can invite $3$ ladies and $3$ gents to a party such that there are $3$ of the man's relatives and $3$ of the wife's relatives,is:

The number of $3$-digit numbers,formed using the digits $2, 3, 4, 5$ and $7$,when the repetition of digits is not allowed,and which are not divisible by $3$,is equal to ..........

$A$ pack contains $n$ cards numbered from $1$ to $n$. Two consecutive numbered cards are removed from the pack and the sum of the numbers on the remaining cards is $1224$. If the smaller of the numbers on the removed cards is $k$,then $k - 20 =$

The number of even numbers greater than $1000000$ that can be formed using all the digits $1, 2, 0, 2, 4, 2, 4$ is