What is the Greatest Common Factor of 36952 and 36958?

Greatest common factor (GCF) of 36952 and 36958 is 2.

GCF(36952,36958) = 2

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

How to find the GCF of 36952 and 36958?

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

Step-1: Prime Factorization of 36952

Prime factors of 36952 are 2, 31, 149. Prime factorization of 36952 in exponential form is:

36952 = 2³ × 31¹ × 149¹

Step-2: Prime Factorization of 36958

Prime factors of 36958 are 2, 17, 1087. Prime factorization of 36958 in exponential form is:

36958 = 2¹ × 17¹ × 1087¹

Step-3: Factors of 36952

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

1, 2, 4, 8, 31, 62, 124, 149, 248, 298, 596, 1192, 4619, 9238, 18476

Step-4: Factors of 36958

List of positive integer factors of 36958 that divides 36952 without a remainder.

1, 2, 17, 34, 1087, 2174, 18479

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 36952 and 36958. The biggest common factor number is the GCF number.
So the greatest common factor 36952 and 36958 is 2.

Also check out the Least Common Multiple of 36952 and 36958