Very clever and difficult number theory puzzle (with generalization)

[mathwizarddud]

For any 10 digit natural number N in which

the first digit corresponds to the total no of 1's.
the 2nd digit corresponds to the total no of 2's.
.
.
.
the 10th digit corresponds to the total no of 0's.

determine, with proof, if the number of such natural number N is finite, and if proved true, find them all.

A generalization of
http://answers.yahoo.com/question/index;_ylt=ArxJYR_e8QoLHAfblB5DIp8Cxgt.;_ylv=3?qid=20080628051813AA0p296

Also, extend this to any numerical base M such that the M^{th} digit corresponds to the total number of 0's and (M - 1)^{th} digit corresponds to the total number of (M - 1)'s for any natural number M, etc.

[CompuChip]

The first part seems quite trivial, as the number of 10 digit natural numbers is finite, so certainly the number of such special 10 digit natural numbers is finite. The question is, how to construct them all? And are numbers like "0100000000" a valid example (because technically, this is a nine digit number).

[Dodo]

I suspect the constraints are so tight that no combination will succeed (find a working example!).

This is the case for base 2, where none of the 4 possible combinations 00, 01, 10 or 11 match the requirements.

P.S.: Also, since the sum of digits must be exactly M, and all individual digits must be <M, there remain few cases to verify for bases 3 and 4, being readily visible that those bases do not work either.

[CompuChip]

And I take back the example I gave, as there should be a number in the last slot to indicate the number of zero's. In fact, I can't think of an example at all at the moment.

[D H]

And are numbers like "0100000000" a valid example (because technically, this is a nine digit number).
Whether "0100000000" counts is a bit irrelevant in the case of base 10 because 0100000000 not a solution to the problem. It is relevant to the general problem because 0202 is a solution for base 4.
I suspect the constraints are so tight that no combination will succeed (find a working example!).
2100010006 is a solution for base 10, and is the only solution for base 10. One way to reduce the complexity of the problem is to focus on the number of zeros. This can't be
0 because there is at least one 0 in abcdefghi0.
1, 2, or 3 because 5+6=11>10.
9, 8, or 7 because there aren't enough non-zero digits left to make any of these three cases work.
4 or 5. These are a bit tougher, but there cannot be 4 zeros or 5 zeros.
That leaves the case of 6 zeros. There is only one solution that works, and this is 2100010006.

[D H]

P.S.: Also, since the sum of digits must be exactly M, and all individual digits must be <M, there remain few cases to verify for bases 3 and 4, being readily visible that those bases do not work either.
There are no solutions for bases 2 and 3, but there are either one or two solutions for base 4, depending on whether numbers with leading zeros count. The two base 4 solutions are 0202 and 2101.

[D H]

There are one or two solutions for base 4, depending on whether 0202 counts as a solution. These are the only solutions up to but not including base 7. There is a general solution for base b=7 and up: b-4 zeros, one b-4, one 2, and two 1s: 2110003, 21010004, 210010005, 2100010006, etc. Without proof, I posit that this general solution is the only solution for base 7 and up.