In this article we study the Zero forcing number of Generalized Sierpinski graphs S(G, t). More precisely, we obtain a general lower bound on the Zero forcing number of S(G, t) and we show that this bound is tight. In particular, we consider the cases in which the base graph G is a star, path, a cycle or a complete graph.