What is the Greatest Common Factor of 36948 and 36959?

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

GCF(36948,36959) = 1

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

How to find the GCF of 36948 and 36959?

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

Step-1: 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-2: Prime Factorization of 36959

Prime factors of 36959 are 13, 2843. Prime factorization of 36959 in exponential form is:

36959 = 13¹ × 2843¹

Step-3: Factors of 36948

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

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

Step-4: Factors of 36959

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

1, 13, 2843

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 36948 and 36959