First of all NP comprised of both P and NPC and can be exponential or cannot be.
But if we precisely concerned for NPC then these problems can take any function greater than polynomial time either exponential, factorial etc. to solve using non deterministic turing machine.
