Repeated Digit Primes
Husk, 15 bytes

!fo§&amp;öεpd´ṘΠdİp


Try it online!

!                 Index into
             İp     the list of primes
 f                    for which:
            d            the digits of p
  o§&amp;                      satisfy both:
     öεpd´Ṙ                  repeated "themselves" times, they form a prime.
           Π                 they are all nonzero.


Erik the Outgolfer saved a byte. Using ṗ instead of εp would save another byte, but that makes the program so slow it times our even for n = 2.