Easy JAVA solution
\n    public int primePalindrome(int n) {\n         boolean flag=false;\n        while(flag==false){\n\n            if(isPalindrome(n)){\n\n                if(i
```\n    public int primePalindrome(int n) {\n         boolean flag=false;\n        while(flag==false){\n\n            if(isPalindrome(n)){\n\n                if(isPrime(n)){\n                    flag=true;\n                    return n;\n                }\n            }\n            else\n                flag=false;\n                n++;\n        }\n\n        return n;\n    }\n      public static boolean isPrime(int n){\n        int count=0;\n        for(int i=1;i<=n;i++){\n\n            if(n%i==0)count++;\n        }\n\n        return count==2;\n    }  \n     public static boolean isPalindrome(int n) {\n        int rev = 0;\n        int temp=n;\n        while (temp > 0){\n           rev = rev * 10 + temp % 10;\n            temp = temp / 10;\n    }\n        return rev==n;\n    }   \n        \n        \n        \n        \n    \n}\n```
[]