Easy to Understand || Java
\nclass Solution\n{\n    public int primePalindrome(int N)\n    {\n        int result = 0 ;\n        if( N == 2 || N == 0 || N == 1 )\n        {\n            re
```\nclass Solution\n{\n    public int primePalindrome(int N)\n    {\n        int result = 0 ;\n        if( N == 2 || N == 0 || N == 1 )\n        {\n            return 2 ;\n        }\n        if( N % 2 == 0 )\n        {\n            N++ ;\n        }            \n        while( true )\n        {\n            StringBuilder sb = new StringBuilder(Integer.toString(N));            \n            if( N == Integer.parseInt( new String( sb.reverse()) ) && isPrime(N) )\n            {\n                return N ;\n            }            \n            N = N + 2 ;\n            if( N > 11 && N < 100 )\n            {\n                N = 101 ;\n            }\n            if( N > 999 && N < 10000 )\n            {\n                N = 10001 ;\n            }\n            if( N > 99999 && N < 1000000 )\n            {\n                N = 1000001 ;\n            }\n            if( N > 9999999 && N < 100000000 )\n            {\n                N = 100000001 ;\n            }\n        }\n    } \n    boolean isPrime( int N )\n    {\n        int i ;                    \n        if( ( N & 1 ) == 0 && N != 2 )\n        {\n            return false ;\n        }\n        else if( N % 3 == 0 && N != 3 )\n        {\n            return false ;\n        }                    \n        else if( N % 11 == 0 && N != 11 )\n        {\n            return false ;\n        }\n        else if( N % 13 == 0 && N != 13 )\n        {\n            return false ;\n        }\n        else if( N % 17 == 0 && N != 17 )\n        {\n            return false ;\n        }\n        else\n        {\n            for( i = 3 ; i <= Math.sqrt(N) ; i += 2 )\n            {\n                if( N % i == 0 )\n                {\n                    return false ;\n                }\n            }\n        }\n        return true ;\n    }\n}\n```
['Java']