  We study the number of factorizations of a positive integer, where the parts
of the factorization are of l different colors (or kinds). Recursive or
explicit formulas are derived for the case of unordered and ordered, distinct
and non-distinct factorizations with at most and exactly l colors.
