What is the Greatest Common Factor of 69483 and 69502?

Greatest common factor (GCF) of 69483 and 69502 is 19.

GCF(69483,69502) = 19

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

How to find the GCF of 69483 and 69502?

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

Step-1: Prime Factorization of 69483

Prime factors of 69483 are 3, 19, 23, 53. Prime factorization of 69483 in exponential form is:

69483 = 3¹ × 19¹ × 23¹ × 53¹

Step-2: Prime Factorization of 69502

Prime factors of 69502 are 2, 19, 31, 59. Prime factorization of 69502 in exponential form is:

69502 = 2¹ × 19¹ × 31¹ × 59¹

Step-3: Factors of 69483

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

1, 3, 19, 23, 53, 57, 69, 159, 437, 1007, 1219, 1311, 3021, 3657, 23161

Step-4: Factors of 69502

List of positive integer factors of 69502 that divides 69483 without a remainder.

1, 2, 19, 31, 38, 59, 62, 118, 589, 1121, 1178, 1829, 2242, 3658, 34751

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 69483 and 69502. The biggest common factor number is the GCF number.
So the greatest common factor 69483 and 69502 is 19.

Also check out the Least Common Multiple of 69483 and 69502