GCD(<number>;<number>;...)
Returns the greatest common divisor, which is an integer that divides into all of the numbers without a remainder.