Very very simple and easy code
Intuition\nTo find a prime and palindrom number \n\n# Approach\nSimple while loop and if condition\n\n# Complexity\n- Time complexity:\n O(n)\n\n- Space complex
# Intuition\nTo find a prime and palindrom number \n\n# Approach\nSimple while loop and if condition\n\n# Complexity\n- Time complexity:\n O(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```java []\nclass Solution {\n  \n    public int primePalindrome(int n) {\n        while(true){\n        if(isPalindrom(n)&&isPrime(n))\n            {\n            return n;\n            }\n            if(n>10000000 && n<100000000){\n                n=100000000;\n            }\n        \n     n++;\n        }\n    }\n    public  boolean isPalindrom(int n){\n        int or= n;\n        int rev=0;\n        while(n>0){\n            int rem=n%10;\n            rev=rev*10+rem;\n            n/=10;\n        }\n        return rev==or;\n    }\n    public boolean isPrime(int n){\n        if(n<2){\n            return false;\n        }\n    for(int i=2;i<=Math.sqrt(n);i++){\n        if(n%i==0){\n            return false;\n        }\n    }\n    return true;\n    }\n}\n```
['Java']