Write a python code to find the largest even primitive integer n

t = 34500958337943

This a very naive code and I'm not getting it to print anything. Please help . It supposed to return a pair of [prime, exponent].

The function should return the largest even primitive integer sufficiently smaller than t.

def factor (n): And Exponents for k in range (a, In** 0): 17. k== 0: exponent- Luhi le n7. (K*x exponent) == 0: exponent+=| pae.append( LK,exponent)) return pae lay=a3' pae - E3,627 prihe expent- for Pair in pae: if pair != : return "prestum not primitive e