The condition of every digit is grater than the next right digit makes a decreasing sequence of 5 digits. example 8,5,3,2,1 or 6,4,3,2,0.
We have total ten digits 0,1,2...9 and in decreasing order :
9,8,7,6,5,4,3,2,1,0
We can pick any five of them from the above sequence and form our required 5 digit number. We cant not permute the selected numbers.
So total no of required numbers = No of ways we can select 5 elements out of 10 from above sequence = $\binom{10}{5}$