# Can we get general computational complexity of finding factors of two almost prime number N if it is not divisible by 2,3,5?

What is computational complexity of finding factors of two almost prime number N, which is not divisible by 2 and 3 and 5?

Can we help our selfs with knowledge that we know digit sum of that number and that we know every digit of that number N

example:341 S(341)=8 = S(1*8) = S(2*4) = S(7*5) Last Digit of number 341 is 1 and this is result of two factors which have last digit 1 and 1 or 3 and 7 or 9 and 9

-

Since factorization is NP, a proof of $P=NP$ would imply that factorization is possible in polynomial time. But factorization is not known to be NP-complete, so it is conceivable that it can be done in polynomial time even if $P\ne NP$.