Search a number
-
+
143066869950913 is a prime number
BaseRepresentation
bin100000100001111001011001…
…111101100110100111000001
3200202120001121011010021202221
4200201321121331212213001
5122223001422201412123
61224140002425411041
742064145256533236
oct4041713175464701
9622501534107687
10143066869950913
1141649356383867
1214067399339a81
1361aa1c006b79c
14274868b21d78d
15118176e65e25d
hex821e59f669c1

143066869950913 has 2 divisors, whose sum is σ = 143066869950914. Its totient is φ = 143066869950912.

The previous prime is 143066869950883. The next prime is 143066869950959. The reversal of 143066869950913 is 319059968660341.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 137427251905969 + 5639618044944 = 11722937^2 + 2374788^2 .

It is an emirp because it is prime and its reverse (319059968660341) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 143066869950913 - 221 = 143066867853761 is a prime.

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

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

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

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

Almost surely, 2143066869950913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 226748160, while the sum is 70.

The spelling of 143066869950913 in words is "one hundred forty-three trillion, sixty-six billion, eight hundred sixty-nine million, nine hundred fifty thousand, nine hundred thirteen".