Service systems with queueing often have both batch arrivals and batch services. This paper focuses on the number of busy servers and waiting customers in the GI(X)/M(R)/infinity system. For the number of busy servers, we obtain a recursive relation for the partial binomial moments in terms of matrices and explicit expressions for the marginal binomial moments. Special cases are also discussed to provide a more heuristic understanding of the model.