What is the Greatest Common Factor of 85902 and 85913?

Greatest common factor (GCF) of 85902 and 85913 is 1.

GCF(85902,85913) = 1

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

How to find the GCF of 85902 and 85913?

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

Step-1: Prime Factorization of 85902

Prime factors of 85902 are 2, 3, 103, 139. Prime factorization of 85902 in exponential form is:

85902 = 2¹ × 3¹ × 103¹ × 139¹

Step-2: Prime Factorization of 85913

Prime factors of 85913 are 53, 1621. Prime factorization of 85913 in exponential form is:

85913 = 53¹ × 1621¹

Step-3: Factors of 85902

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

1, 2, 3, 6, 103, 139, 206, 278, 309, 417, 618, 834, 14317, 28634, 42951

Step-4: Factors of 85913

List of positive integer factors of 85913 that divides 85902 without a remainder.

1, 53, 1621

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 85902 and 85913