Two positive integers (both greater than 1) are coprime if and only if they have no prime factors in common.
The prime factorization of a positive integer is a list of the integer's prime factors, together with the maximum power of each prime factor that divides the integer exactly. The fundamental theorem of arithmetic says that every positive integer has a unique prime factorization.
For a positive integer n, the number of prime factors of n and the sum of the prime factors of n (not counting multiplicity) are examples of arithmetic functions of n that are additive but not completely additive.
Examples: