A number puzzle

Someone gave me this puzzle and I'm working on this one. It is quite interesting and thought I'd post it on my blog too.

Here is the question:

Find a number consisting of 9 digits in which each of the digits from 1 to 9 appears only once. This number should satisfy the following

requirements:

a. The number should be divisible by 9.

b. If the most right digit is removed, the remaining number should be divisible by 8.

c. If then again the most right digit is removed, the remaining number should be divisible by 7.

d. etc. until the last remaining number of one digit which should be divisible by 1.