gcd(a,b) = greatest common divisor (or factor, whatever) of a and b.
For any set of number, a1, a2, a3, ..., you can use the Euclidean algorithm (http://en.wikipedia.org/wiki/Euclidean_algorithm) to get the gcd(a1, a2), and then again to get gcd(gcd(a1, a2), a3), etc.
Often, though, you can eyeball it. So 24*3 = 72. Therefore, gcd(24, 72)=24. 24 does not divide 132, but 12 does (the next biggest factor of 24), so gcd(24, 72, 132)=12.
The greatest common factor of 132 , 286 = 22
The greatest common factor of 105 and 132 is 3.
The greatest common factor of 132 and 225 is 3.
The greatest common factor of 132 and 144 is 12.
The greatest common factor of 84 132 and 156 is 12.
The greatest common factor of the numbers 132 and 55 is 11.
The greatest common factor of 132 , 286 = 22
The greatest common factor of 105 and 132 is 3.
The greatest common factor of 132 and 225 is 3.
The greatest common factor of 132 and 144 is 12.
The greatest common factor of 84 132 and 156 is 12.
The Greatest Common Factor of 99, 132, 165: 33
greatest common factor of 54 and 132 is 6.
The greatest common factor is 12.
The greatest common factor of 66 , 132 = 66
1 is the greatest common factor of 53, 132 and 143.
The GCF of 26 and 132 is 2.