If $A$ is $n\times m$ and $n>m$, then the rank of $A$ cannot be $n$, because the rank is at most $\min(n,m)$.
The result is true if the rank of $A$ is $m$ (number of columns), because the rank of $A^TA$ is the same as the rank of $A$.
Actually you can say that $A$ has rank $m$ (number of columns) if and only if $A^TA$ is invertible.
Proof. Denote by $C(A)$ the column space and by $N(A)$ the null space of $A$. The rank-nullity theorem says that $m=\dim C(A)+\dim N(A)$. It is also easy to prove that $N(A)=N(A^TA)$. Therefore $\dim N(A^TA)=0$ (which is equivalent to $A^TA$ being invertible) if and only if $\dim C(A)=m$, that is, $A$ has rank $m$. QED
Dually, $A$ has rank $n$ (number of rows) if and only if $AA^T$ is invertible.