What is the Greatest Common Factor of 89948 and 89953?

Greatest common factor (GCF) of 89948 and 89953 is 1.

GCF(89948,89953) = 1

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

How to find the GCF of 89948 and 89953?

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

Step-1: Prime Factorization of 89948

Prime factors of 89948 are 2, 113, 199. Prime factorization of 89948 in exponential form is:

89948 = 2² × 113¹ × 199¹

Step-2: Prime Factorization of 89953

Prime factors of 89953 are 23, 3911. Prime factorization of 89953 in exponential form is:

89953 = 23¹ × 3911¹

Step-3: Factors of 89948

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

1, 2, 4, 113, 199, 226, 398, 452, 796, 22487, 44974

Step-4: Factors of 89953

List of positive integer factors of 89953 that divides 89948 without a remainder.

1, 23, 3911

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 89948 and 89953