private boolean leftToRightPrime(int n) {
        int loop = String.valueOf(n).length() - 1;
        for (int i = 0; i < loop; i++) {
            n -= (int)Math.pow(10,String.valueOf(n).length() - 1) * 
                    (String.valueOf(n).charAt(0) - 48);
            if (!EulerFunction.isPrime(n))
                return false;
        }
        return true;
    }