Buscador de divisores

def f(n):
    m=2
    z=int(n/2)
    div=[(1,n)]

    if n>2 :
        if n%2==0:
            divs.append((2,int(n/2)))
        while z>=m:
            m+=1
            if n%m==0:
                z=int(n/m)
                divs.append((m,z))
            else:
                z=int(n/m)
    return divs