What is the time-complexity of the following factorization code?

Sqrt(x) is 2^(n/2) right? what about the while loop complexity?

input: n-bit integer X // see not below the algorithm output: list of prime factors and their multiplicity acc =X count 0 acc = acc / i count = count + 1 if count0 print i (count) Note:: lkxall thai the rauig: of values of all it hit iuiger is 0