Proof Writing & Problem Solving · Superchallenge problem

A list has twelve statements $S_1, S_2, \ldots, S_{12}$. Statement $S_k$ says: "The number of true statements in this list is a multiple of $k$." In how many ways can each statement be assigned true or false so that every statement's assigned value matches what it actually says?