Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for agiven degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that thecycle prefix digraphs, like the Kautz digraphs, contain cycles of alllengths l, with l between two and N, the order of the digraph, exceptfor N-1.