One way to approach it:
Assuming all digits must be used:
There are 5 possible positions where the 6 can be placed. Once we've placed that, there are 5 positions for the 5 (6 places, minus one that's already been filled), then 4 positions for the 4, and so on. So we end up with 5*5*4*3*2*1 = 5*5! or equivalently 6!-5!.
This is almost identical to the answer given by markovchain, but instead of working from "what digit shall we assign to each position?" it works from the other side, assigning a position to each digit.
In this particular case, either approach is equally easy to use. But for some problems, it may be easier to go from one direction than the other, so worth keeping in mind that both options exist.
Assuming that we don't have to use all digits:
Same as above, but we also need to calculate the totals for 5, 4, 3, 2, and 1 digits. In these cases the "less than 600000" requirement isn't an issue, so any digit can go in any place.
This then gives a total of (6!-5!)+(6*5*4*3*2)+(6*5*4*3)+(6*5*4)+(6*5)+6 solutions.