A coalition in a graph G consists of two disjoint sets of vertices and , neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G is a vertex partition such that every set is not a dominating set but forms a coalition with another set which is not a dominating set. The coalition number equals the maximum k of a coalition partition of G. In this paper, we study the coalition number of the dth power of the n-cycle , where and . We show that for or , and also provide some bounds of for the other cases. As a special case, we obtain the exact value of the coalition number of .