P-complete decision problems about integers Are there any known examples of P-complete decision problems which take as input a single integer? (non-unary, as unary feels like un-naturally forcing the issue)

It feels like there are many inherently sequential questions I could ask about an integer, but I don't know of any examples that have been shown to be P-complete.
Not quite what you're looking for, but the iterated mod problem is a P-complete number-theoretic decision problem.