Search a number
-
+
143490070697 is a prime number
BaseRepresentation
bin1000010110100010101…
…1001011100010101001
3111201101001212211200212
42011220223023202221
54322331424230242
6145530214110505
713236550322351
oct2055053134251
9451331784625
10143490070697
1155943449996
122398664b435
13106b9962c9c
146d32d63b61
153aec31b782
hex2168acb8a9

143490070697 has 2 divisors, whose sum is σ = 143490070698. Its totient is φ = 143490070696.

The previous prime is 143490070679. The next prime is 143490070709. The reversal of 143490070697 is 796070094341.

It is a happy number.

Together with previous prime (143490070679) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 143477318656 + 12752041 = 378784^2 + 3571^2 .

It is a cyclic number.

It is not a de Polignac number, because 143490070697 - 28 = 143490070441 is a prime.

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

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

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

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

Almost surely, 2143490070697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1143072, while the sum is 50.

The spelling of 143490070697 in words is "one hundred forty-three billion, four hundred ninety million, seventy thousand, six hundred ninety-seven".