Is it known any lower and upper bound for $$ \sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k $$ where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$.

Or at least if it is known it is always positive?

Are there known any lower and upper bounds for $$ \sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k, $$ where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$?

Or at least is it known if it is always positive?

Is it known any lower and upper bound for $$ \sum_{k=1}^n \frac{(-1)^{\Omega(n)}}n $$ where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$.

Or at least if it is known it is always positive?

Is it known any lower and upper bound for $$ \sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k $$ where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$.

Or at least if it is known it is always positive?