What is the Greatest Common Factor of 95937 and 95948?

Greatest common factor (GCF) of 95937 and 95948 is 1.

GCF(95937,95948) = 1

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

How to find the GCF of 95937 and 95948?

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

Step-1: Prime Factorization of 95937

Prime factors of 95937 are 3, 113, 283. Prime factorization of 95937 in exponential form is:

95937 = 3¹ × 113¹ × 283¹

Step-2: Prime Factorization of 95948

Prime factors of 95948 are 2, 17, 83. Prime factorization of 95948 in exponential form is:

95948 = 2² × 17² × 83¹

Step-3: Factors of 95937

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

1, 3, 113, 283, 339, 849, 31979

Step-4: Factors of 95948

List of positive integer factors of 95948 that divides 95937 without a remainder.

1, 2, 4, 17, 34, 68, 83, 166, 289, 332, 578, 1156, 1411, 2822, 5644, 23987, 47974

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 95937 and 95948