Simple Java Solution||
\nclass Solution {\n    public int primePalindrome(int N) {\n     if(N==1 ||N==2)\n         return 2;\n     \n    if(N%2==0)\n        N=N+1;\n        \n     whi
```\nclass Solution {\n    public int primePalindrome(int N) {\n     if(N==1 ||N==2)\n         return 2;\n     \n    if(N%2==0)\n        N=N+1;\n        \n     while(true){\n           if( palindrome(N) && prime(N) ){\n               return N;\n           } \n         N+=2;\n         \n         if (10_000_000 < N && N < 100_000_000)\n                N = 100_000_001;\n     }  \n    }\n    \n    \n    public boolean palindrome(int N){\n        if(N%10==0 && N!=0)\n            return false;\n        \n        int reverseNumber=0;\n        int num=N;\n        while(num>0){\n            reverseNumber=reverseNumber*10+num%10;\n            num/=10;    \n        }\n        return reverseNumber==N || N== reverseNumber / 10;\n    }\n    \n    \n    \n    public boolean prime(int N){\n        if(N%2==0) return false;\n        \n        for(int i=3;i<N/2+1; i+=2)\n              if(N%i==0)\n                  return false;\n          \n        return true;\n    }\n}\n```
['Java']