Search a number
-
+
143021324681 is a prime number
BaseRepresentation
bin1000010100110010111…
…1000011100110001001
3111200011101212002001022
42011030233003212021
54320401424342211
6145411511202225
713222126126034
oct2051457034611
9450141762038
10143021324681
115572289a094
1223875676375
1310643801891
146cca9c601b
153ac10c8bdb
hex214cbc3989

143021324681 has 2 divisors, whose sum is σ = 143021324682. Its totient is φ = 143021324680.

The previous prime is 143021324623. The next prime is 143021324707. The reversal of 143021324681 is 186423120341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114182492281 + 28838832400 = 337909^2 + 169820^2 .

It is a cyclic number.

It is not a de Polignac number, because 143021324681 - 26 = 143021324617 is a prime.

It is a super-2 number, since 2×1430213246812 (a number of 23 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (143021324081) 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, 71510662340 + 71510662341.

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

Almost surely, 2143021324681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27648, while the sum is 35.

The spelling of 143021324681 in words is "one hundred forty-three billion, twenty-one million, three hundred twenty-four thousand, six hundred eighty-one".