What is the Greatest Common Factor of 31447 and 31458?

Greatest common factor (GCF) of 31447 and 31458 is 1.

GCF(31447,31458) = 1

We will now calculate the prime factors of 31447 and 31458, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 31447 and 31458.

How to find the GCF of 31447 and 31458?

We will first find the prime factorization of 31447 and 31458. After we will calculate the factors of 31447 and 31458 and find the biggest common factor number .

Step-1: Prime Factorization of 31447

Prime factors of 31447 are 13, 41, 59. Prime factorization of 31447 in exponential form is:

31447 = 13¹ × 41¹ × 59¹

Step-2: Prime Factorization of 31458

Prime factors of 31458 are 2, 3, 7, 107. Prime factorization of 31458 in exponential form is:

31458 = 2¹ × 3¹ × 7² × 107¹

Step-3: Factors of 31447

List of positive integer factors of 31447 that divides 31447 without a remainder.

1, 13, 41, 59, 533, 767, 2419

Step-4: Factors of 31458

List of positive integer factors of 31458 that divides 31447 without a remainder.

1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 107, 147, 214, 294, 321, 642, 749, 1498, 2247, 4494, 5243, 10486, 15729

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 31447 and 31458. The biggest common factor number is the GCF number.
So the greatest common factor 31447 and 31458 is 1.

Also check out the Least Common Multiple of 31447 and 31458