how many permutations can a 18 digit number have? How can I work out how many permutations a 18 digit number may have that using digits 0-9?
I found this (How many permutations are there if you have n+1 items, where the extra item can be repeated?) question but as I am not a mathematician I don't understand the equation cited in the answer: http://en.wikipedia.org/wiki/Laguerre_polynomials
Please could I get an explanation in simpler terms, assuming it is something to easily explain and it is the equation I require?
 A: It sounds like you're not interested in permutations.  I think what you're asking is "how many 18 digit decimal numbers are there?", to which the answer is $9 \times 10^{17}$ (since there are 9 possibilities for the first digit and 10 for each of the remaining 17).
If you were interested in how many permutations there are of a particular 18 digit number, let's say we have a $k$ digit number with $d_i$ copies of the digit $i$ (so we have $k = \sum_i d_i$).  So for example, the 3 digit number 122 has $d_2 = 2, d_1 = 1$ and $d_0 = d_3 = \ldots = d_9 = 0$.  Then the number of permutations of this number (ignoring the leading 0 thing for a moment) is:
$$ \frac{k!}{\Pi_i d_i} $$
So to return to our example of 122, the number of permutations is:
$$\frac{3!}{2! \times 1! \times 0! \times \ldots \times 0!} = \frac{6}{2} = 3$$
What's happened is that the numerator is the number of ways of permuting all the digits (ignoring duplicate digits) and each term in the denominator is the number of ways of permuting one set of duplicate digits.
To correct for the fact that numbers aren't allowed to have leading zeroes, we can change the our formula a little in the case that our number contains one or more 0 digits by subtracting the number of permutations that have a leading 0:
$$ \frac{k!}{\Pi_i d_i} - \frac{(k-1)!}{(d_0 - 1)! \times \Pi_{i > 0}d_i!} $$
