Note that your current definitions of the projection matrices $\{P_{1},P_{2},...,P_{n}\}$ are actually not projection matrices, since $P_{i}^{2} = I \not= P_{i} \,\, \forall i$.
What works 'better' is if you have something like:
\begin{equation}
\begin{split}
P_{1}^{+1} =& |0\rangle\langle 0 | \otimes I \otimes I....\otimes I \\
P_{1}^{-1} =& |1\rangle\langle 1 | \otimes I \otimes I....\otimes I \\
P_{2}^{+1} =& I \otimes |0\rangle\langle 0 | \otimes I....\otimes I \\
P_{2}^{-1} =& I \otimes |1\rangle\langle 1 | \otimes I....\otimes I \\
& \vdots \\
P_{n}^{+1} =& I \otimes I....\otimes I \otimes |0\rangle\langle 0|\\
P_{n}^{-1} =& I \otimes I.... \otimes I \otimes |1\rangle\langle 1 |\\
\end{split}
\end{equation}
However, a PVM must have that $\sum_{i = 0}^{2n-1} P_{i} = I$, which is clearly not the case here!
One could solve for this by renormalizing, but there is another thing missing here: these projectors actually don't account for any correlations that the measurements might have.
A better 'choice' is therefore the measurement operators $Z_{n} = Z \otimes Z \otimes Z ... \otimes Z$. This operator has $2^{n}$ eigenvectors:
$$Z_{n} = \sum_{i \in \{0,1\}^{n}} m_{i} |i\rangle\langle i|,$$
where $m_{i} = 1 - 2p_{m} = \pm 1$ with $p_{m}$ the parity of the bitstring $i$ (i.e. $m_{i} = +1$ if the parity is even and $m_{i} = -1$ when the parity is odd). The problem here is that the measurement might only return the measurement outcome, so that you only learn the parity of the measured state.
If you want to tell all the different states apart, it is better to associate each state $|i\rangle$ with its own measurement outcome. If $i_{d}$ is the decimal representation of the bitstring $i$, a clear choice is to associate this decimal representation with the state $|i\rangle$ as the measurement outcome. The observable $D$ for this measurement is then:
$$
D = \sum_{i} i_{d} |i\rangle\langle i|.
$$
This is also the content of the answer by DaftWullie.