A divisor d of n for which GCD(d, n/d) = 1, where GCD(m, n) is the greatest common divisor. For example, the divisors of 12 are {1, 2, 3, 4, 6, 12}, so the unitary divisors are {1, 3, 4, 12}. A list of unitary divisors of a number n an be computed in the Wolfram Language using: UnitaryDivisors[n_Integer] := Sort[Flatten[Outer[ Times, Sequence @@ ({1, #}& /@ Power @@@ FactorInteger[n]) ]]]

biunitary divisor | divisor | greatest common divisor | infinitary divisor | k-ary divisor | unitary aliquot sequence | unitary amicable pair | unitary divisor function | unitary perfect number