Sorry for the straightforward question. But if we have actually a 5-digit number and each digit have the right to hold a value from 0-9. Then just how many feasible combinations room there? Also, what formula can you use to get this in other instances of different digits. (If any kind of at all).

You are watching: How many 5 digit numbers can be formed using 0-9


In general, in base b, there would be bn possible combinations the n digits. For your question, you deserve to substitute b = 10 and also n = 5 to acquire 100000. You could have accidentally exclude, the combination 00000 as soon as you come up v 99999 as the variety of combinations.

However, this includes combinations that start with 0 (e.g. 00135), which space not normally taken into consideration to it is in five-digit numbers. If you desire to exclude, those (and suspect n > 1), then you subtract away all the combinations starting with 0, of i m sorry there are bn−1, to gain bn−bn−1 = (b−1)bn−1 together the last answer.

Just to make this less abstract and more concrete:

If friend exclude 0 because that the an initial digit, you have actually 9 choices for it: 1, 2, 3, 4, 5, 6, 7, 8, 9. Because that the other digits, you have 10 options to choose from.

So the total variety of combinations is 9×10×10×10×10 = 9×104 = (b-1) bn-1 because that b = 10.

The variety of 5-digit combine is 105=100,000. So, one more than 99,999. You have the right to generalize that: the number of N-digit combinations is 10N.

Now, this assumes that you count 00000 or 00534 as "5-digit numbers". If you pick to not count any mix of 5 digits beginning with a leading 0, climate the very first 5-digit number is 10,000 and also the critical 5-digit number is 99,999. That offers you 90,000 5-digit numbers. In that case the basic formula would certainly be 9*10N-1 for the variety of possible N-digit numbers.

You deserve to generalize this formula to various other bases as well. Due to the fact that there room 26 letters and also 10 1-digit numbers, climate a case-sensitive alpha-numeric password contains 26+26+10=62 possible inputs for each character. One N-character password would as such have 62N possible combinations.

Assuming the very first digit have the right to be 0, there are 100000 together combinations (because ~ chopping off the early stage zeroes, each mix gives a number between 0 and also 99999 and there room obviously 100000 the those).

If the an initial digit can't it is in zero (so the the number is genuinely five digits long), there are 100000 - 10000 = 90000 (we are just taking away 00000 v 09999).

See more: How To Get A Woman To Swallow Ing, How To Swallow Cum €” If That’S Your Thing

Maybe the simplest way is simply to count, no permutations/comb necessary. Smallest 5 digit number is 10000, biggest 99999. And also then simply their distinction is 89999, then add 1 to include the very first number, for this reason 90000.