Search a number
-
+
143196257 is a prime number
BaseRepresentation
bin10001000100100…
…00000001100001
3100222110010100002
420202100001201
5243124240012
622113105345
73356101541
oct1042200141
9328403302
10143196257
1173915516
123bb58255
1323889119
1415037321
15c8887c2
hex8890061

143196257 has 2 divisors, whose sum is σ = 143196258. Its totient is φ = 143196256.

The previous prime is 143196211. The next prime is 143196311. The reversal of 143196257 is 752691341.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 139806976 + 3389281 = 11824^2 + 1841^2 .

It is a cyclic number.

It is not a de Polignac number, because 143196257 - 216 = 143130721 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 143196257.

It is not a weakly prime, because it can be changed into another prime (143196857) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (7) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71598128 + 71598129.

It is an arithmetic number, because the mean of its divisors is an integer number (71598129).

Almost surely, 2143196257 is an apocalyptic number.

It is an amenable number.

143196257 is a deficient number, since it is larger than the sum of its proper divisors (1).

143196257 is an equidigital number, since it uses as much as digits as its factorization.

143196257 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 45360, while the sum is 38.

The square root of 143196257 is about 11966.4638469349. The cubic root of 143196257 is about 523.1712724787.

The spelling of 143196257 in words is "one hundred forty-three million, one hundred ninety-six thousand, two hundred fifty-seven".