05AB1E, 15 bytes

0-indexed.

11Iµ11N*DÂQNp*½

Try it online!

Explanation

11               # initialize stack with 11
  Iµ             # loop over N until counter equals input
    11N*         # multiply N by 11
        D        # duplicate
         ÂQ      # check if the copy equals its reverse
           Np    # check if N is prime
             *   # multiply the results of the checks together
              ½  # if 1, increase counter