Let's study your code
while(i>=1)
{
i=i/2;
i=i/3;
i=i/5;
i=i*10;
i=i-10;
}
the expression i=i/2,i=i/5 and i=i*10 will together get nullify
So I can rewrite your code as
while(i>=1)
{
i=i/3;
i=i-10;
}
Now, the running time depends on how the sub-problem size decreases every time.
Initially it will be n.
After $1^{st}$ iteration it will be $\frac{n}{3}-10$
After second iteration it will be $\frac{ \frac {n}{3}-10}{3}-10$ = $\frac{n}{3^2}-10(1+\frac{1}{3})$
So, after $K^{th}$ iteration your problem size would be
$\frac{n}{3^k}-10(1+\frac{1}{3}+\frac{1}{3^2}+......+\frac{1}{3^{k-1}})$
Simplfiy this and you will get
$\frac{n}{3^k}-10(\frac{1-\frac{1}{3^k}}{1-\frac{1}{3}})$
and this becomes $\frac{n}{3^k}+15(1-\frac{1}{3^k})$
For purpose of complexity, you can ignore the term $15(1-\frac{1}{3^k})$ as it will be a constant
So, the loop will terminate when $\frac{n}{3^k}=1$ which makes k=$\log_3n$
So your complexity is $O(log_3n)$