Search a number
-
+
142691055711067 is a prime number
BaseRepresentation
bin100000011100011011011001…
…101100000011001101011011
3200201020010120000022211111201
4200130123121230003031123
5122200322240230223232
61223251211022135031
742025042244311423
oct4034333154031533
9621203500284451
10142691055711067
1141513a34000aa6
1214006595a21477
13618092a369436
1427343d920d483
151176ac61ebbe7
hex81c6d9b0335b

142691055711067 has 2 divisors, whose sum is σ = 142691055711068. Its totient is φ = 142691055711066.

The previous prime is 142691055711019. The next prime is 142691055711077. The reversal of 142691055711067 is 760117550196241.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 142691055711067 - 231 = 142688908227419 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 142691055710999 and 142691055711017.

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

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

Almost surely, 2142691055711067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3175200, while the sum is 55.

The spelling of 142691055711067 in words is "one hundred forty-two trillion, six hundred ninety-one billion, fifty-five million, seven hundred eleven thousand, sixty-seven".