Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations, including derangements and involutions. By establishing a bijective correspondence between colored permutations and colored Lehmer codes, we develop a unified framework for enumerating colored Mahonian numbers and analyzing their combinatorial properties. We derive explicit formulas, recurrence relations, and generating functions for the number of inversions in these families, extending classical results to the colored setting. We conclude with explicit expressions for inversions in colored derangements and involutions.