Largest palindrome product

//http://projecteuler.net/problem=4


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace LargestPalindromeProduct
{
    class Program
    {
        static void Main(string[] args)
        {
            int LargestPossibleNumber = 998001;// 999 * 999;
            //Try to find nearst palindome to 998001;
            var before = DateTime.Now;
             for (int i = 9; i >= 0; i--)
            {
                for (int j = 9; j >= 0; j--)
                {
                    for (int k = 9; k >= 0; k--)
                    {
                        string palidormNumber = i.ToString() + j.ToString() + k.ToString() + k.ToString() + j.ToString() + i.ToString();
                        Console.Write(palidormNumber + ", ");
                        int numb = int.Parse(palidormNumber);
                        if (numb < LargestPossibleNumber  )
                        {
                            if (IsMultipleOfThreeByThree(numb)  )
                            {
                                Console.WriteLine();
                                Console.WriteLine(numb);
                                var after = DateTime.Now;
                                Console.WriteLine(after - before);
                                return;
                            }
                        }                            

                    }
                  
                }

               
            }
            
             

        }

        private static bool IsMultipleOfThreeByThree(int numb)
        {
            for (int i = 999; i > 99; i--)
            {
                if (numb % i == 0)
                {
                    if ((numb / i).ToString().Length == 3)
                    {
                        Console.WriteLine(i + "  --  " + (numb / i));
                        return true;
                    }
                        
                }
            }
            return false;
        }
    }
}