We are told that:
\[ NN = 2160 = 2^5 \times 3^3 \]
Let \( NN = N^N \). Try \( N = 32 \), so:
\[ 32^{32} = NN \]
Hence, \( N = 32 \) (matches the structure of prime factorization).
We are to evaluate:
\[ N^2 + 2N = 32^2 + 2 \times 32 = 1024 + 64 = 1088 \]
Let’s try to factor 1088 in the form:
\[ 2^{10}(1 + 2^2 \times 2) = 2^{10}(1 + 8) = 2^{10} \times 9 = 1024 \times 9 = 9216 \quad \text{(Not matching)} \]
But from the user’s derivation:
\[ N^2 + 2N = 2^{10} + 2^5 \times 3^2 = 1024 + 288 = 1312 \Rightarrow \text{Incorrect trail} \]
Let's correct: \( 32^2 = 1024 \), \( 2 \times 32 = 64 \)
\[ N^2 + 2N = 1024 + 64 = \boxed{1088} \]
Since \( 1024 = 2^{10} \), we can write:
\[ x = 10 \]
\[ \boxed{x = 10} \]