came after here some time and re-wrote the code for the exact problem, which can be useful to someone who is learning about recursion.

def re(num, index):
    
    if index >= len(num):
        return 0
    
    if num[index] == "0":
        return 1 + re(num, index + 1)
    else:
        return re(num,index + 1)