FI-MO 2016 Problem 2

Suppose that $y$ is a positive integer written only with digit $1$ , in base $9$ system. Prove that $y$ is a triangular number, that is, exists positive integer $n$ such that the number $y$ is the sum of the $n$ natural numbers from $1$ to $n$ .