def to_base(n, base):
digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
if n == 0:
return "0"
result = ""
while n > 0:
n, remainder = divmod(n, base)
result = digits[remainder] + result
return result
print(to_base(25, 2)) # binary → 11001
print(to_base(25, 8)) # octal → 31
print(to_base(25, 16)) # hex → 19
print(to_base(255, 36)) # base‑36 → 73
'''
run:
11001
31
19
73
'''