Search a number
-
+
143131562151293 is a prime number
BaseRepresentation
bin100000100010110101101001…
…111010110000110101111101
3200202210020120122220120101102
4200202311221322300311331
5122230031414402320133
61224225422032022445
742101625353262362
oct4042655172606575
9622706518816342
10143131562151293
1141673833447481
1214077a32691a25
1361b332c9585b1
14274b866d30469
1511832a8cb87e8
hex822d69eb0d7d

143131562151293 has 2 divisors, whose sum is σ = 143131562151294. Its totient is φ = 143131562151292.

The previous prime is 143131562151233. The next prime is 143131562151299. The reversal of 143131562151293 is 392151265131341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114111383737849 + 29020178413444 = 10682293^2 + 5387038^2 .

It is a cyclic number.

It is not a de Polignac number, because 143131562151293 - 26 = 143131562151229 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2143131562151293 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 583200, while the sum is 47.

The spelling of 143131562151293 in words is "one hundred forty-three trillion, one hundred thirty-one billion, five hundred sixty-two million, one hundred fifty-one thousand, two hundred ninety-three".