Find the greatest common factor, least common multiple and prime factorisation of one or more integers. Euclidean algorithm for GCF; trial division up to √n for factors. Integers only, up to 12 digits.