Let n = p1α1p2α2⋯prαrpr+1αr+1⋯pvαv, where p1,p2,⋯,pv are distinct odd primes, be an integer and Fq be a finite field of order q with gcd(q,n) = 1. We determine the weight enumerators of all irreducible cyclic codes of length n over Fq when multiplicative order of q modulo piαi is piβi; 1 ≤ i ≤ r and 2piβi; r + 1 ≤ i ≤ v, where 0 ≤ βi ≤ αi - 1. © 2023 World Scientific Publishing Company.