How often do you need to do unsigned integer division? I've been programming for 20 years without once wanting it.
I have a somewhat obscure usage for you that you might not have thought of.
You can perform optimizations when using products of prime numbers (you can fit more in an unsigned number). For instance, to test if a number is missing from a given set, just see if the remainder is zero. Where this may be useful instead of just using bit operations (and where division comes in) is when you may have the same prime multiplied more than once. You can then check the remainder, if zero, do an unsigned divide of the original product and then check the remainder again (rinse & repeat).
Again, not likely to come up often. But this maybe useful in scenarios where many rows of numbers with some unknowns have to be optimized for space and/or you would like to omit some slower to process 'if' statements.