C# - Find Prime Factors of a number

C# - Find Prime Factors of a number

CODE

using System; class Program { public static void Main(string[] args) { int number = 3456789; findPrimeFactors(number); Console.ReadKey(); } public static void findPrimeFactors(int number) { Console.Write("The Prime Factors are: "); int possiblePrimeFactor = 2; while (possiblePrimeFactor <= number) { while (number % possiblePrimeFactor == 0) { Console.Write(possiblePrimeFactor + " "); number = number / possiblePrimeFactor; } possiblePrimeFactor = getNextPrime(possiblePrimeFactor); } } private static int getNextPrime(int number) { int possibleNextPrime = number + 1; while (!isPrime(possibleNextPrime)) { possibleNextPrime++; } return possibleNextPrime; } private static bool isPrime(int number) { bool result = true; if (number < 2) result = false; else { for (int i = 2; i < number; i++) { if (number % i == 0) { result = false; break; } } } return result; } }