For any integer $n \geq 1$,the number of positive divisors of $n$ is denoted by $d(n)$. Then,for a prime $P$,$d(d(d(P^7)))$ is equal to

The largest value of $n$, for which $40^n$ divides $60!$, is

The smallest positive divisor greater than $1$ of a composite number $a$ is

Three players play a total of $9$ games. In each game,one person wins and the other two lose; the winner gets $2$ points and the losers get $-1$ each. The number of ways in which they can play all the $9$ games and finish each with a zero score is

If $1000! = 3^n \times m$ where $m$ is an integer not divisible by $3$, then $n = $

If the number of terms in the expansion of ${\left( {1 - \frac{2}{x} + \frac{4}{{{x^2}}}} \right)^n}, x \ne 0$ is $28$,then the sum of the coefficients of all the terms in this expansion is: