I'm trying to make a program that finds the largest palindrome that is a product of two 3-digit numbers. This is what I have right now (I am new to programming):
    int num1 = 0;
    int num2 = 0;
    int product = 0;
    int tempProd1 = 0;
    int tempProd2 = 0;
    int tempProd3 = 0;
    int tempProd4 = 0;
    int tempProd5 = 0;
    int tempProd6 = 0;
    String prodCheck1 = "";
    String prodCheck2 = "";
    while (num1 < 1000){
        while (num2 < 1000){
            product = num1 * num2;
            prodCheck1 = Integer.toString(product);
            tempProd1 = product % 10;
            product = product / 10;
            tempProd2 = product % 10;
            product = product / 10;
            tempProd3 = product % 10;
            product = product / 10;
            tempProd4 = product % 10;
            product = product / 10;
            tempProd5 = product % 10;
            product = product / 10;
            tempProd6 = product % 10;
            product = product / 10;             
            prodCheck2 = "tempProd1" + "tempProd2" + "tempProd3" + "tempProd4" + "tempProd5" + "tempProd6";
            if (prodCheck1 == prodCheck2){
                System.out.println(prodCheck1);
            }   
            num2++;
        }
        num1++;
    }   
Thing is, every time I try to run it, it terminates without an error. Could someone explain what I'm doing wrong?
Edit: Thanks everyone, finally fixed it. The answer is 853358, if anyone was wondering.
Edit: Actually, the number was 906609.
 
     
     
     
    