Intuitive Java solution
\n\n# Code\n\nclass Solution {\n    public int primePalindrome(int n) {\n        if(n == 0 || n == 1) return 2;\n        return helper(n); \n    }\n\n    int he
\n\n# Code\n```\nclass Solution {\n    public int primePalindrome(int n) {\n        if(n == 0 || n == 1) return 2;\n        return helper(n); \n    }\n\n    int helper(int n) {\n        if (10_000_000 < n && n < 100_000_000) return helper(100_000_000);\n        if(isPrime(n) && isPal(n)) return n;\n        if(n % 2 == 0) {\n            return helper(n+1);\n        }else{\n            return helper(n+2);\n        }\n    }\n\n    boolean isPrime(int n) {\n\n        for(int i = 2; i<=(int) Math.sqrt(n); i++) {\n            if(n%i == 0) return false;\n        }\n        return true;\n    }\n\n\n    boolean isPal(int n) {\n        int rev = 0;\n        int temp = n;\n        while(n != 0) {\n            int r = n%10;\n            rev = rev*10+r;\n            n = n/10;\n        }\n        return rev == temp;\n    }\n}\n```
['Java']