What is the Greatest Common Factor of 36937 and 36948?

Greatest common factor (GCF) of 36937 and 36948 is 1.

GCF(36937,36948) = 1

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

How to find the GCF of 36937 and 36948?

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

Step-1: Prime Factorization of 36937

Prime factors of 36937 are 43, 859. Prime factorization of 36937 in exponential form is:

36937 = 43¹ × 859¹

Step-2: Prime Factorization of 36948

Prime factors of 36948 are 2, 3, 3079. Prime factorization of 36948 in exponential form is:

36948 = 2² × 3¹ × 3079¹

Step-3: Factors of 36937

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

1, 43, 859

Step-4: Factors of 36948

List of positive integer factors of 36948 that divides 36937 without a remainder.

1, 2, 3, 4, 6, 12, 3079, 6158, 9237, 12316, 18474

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 36937 and 36948