write python code for this with NO strings

An Emirp prime is a prime number which becomes a different prime number when its digits are reversed. For example, $13$ is an Emirp prime because when we reverse the digits, we get $31,$ which is also prime. $2,3,5,7,$ and $11$ are not Emirp primes because they are the same prime when the digits are reversed. The $0$th Emirp prime is $13.$

With this in mind, write the function nthEmirpPrime$($n$)$ which takes a non$-$negative int n$,$ and returns the nth Emirp prime as described above.