What is the Greatest Common Factor of 36933 and 36952?

Greatest common factor (GCF) of 36933 and 36952 is 1.

GCF(36933,36952) = 1

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

How to find the GCF of 36933 and 36952?

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

Step-1: Prime Factorization of 36933

Prime factors of 36933 are 3, 13, 947. Prime factorization of 36933 in exponential form is:

36933 = 3¹ × 13¹ × 947¹

Step-2: 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-3: Factors of 36933

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

1, 3, 13, 39, 947, 2841, 12311

Step-4: Factors of 36952

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 36933 and 36952