base conversion

hi, If we are to convert a k-bit integer n to a base b number,it takes us O(log n) if the base b is a power of 2. eg. converting (11111)base to base 16 0001 1111 ^ ^ 1 F in hex. using a look up table. Is there an algorithm with time complexity O(log n) which allows such conversion to base b ,when b is not a power of 2? Thanks. Regards Sarath. __________________________________ Do you Yahoo!? The New Yahoo! Shopping - with improved product search http://shopping.yahoo.com