Search a number
-
+
110010141010067 is a prime number
BaseRepresentation
bin11001000000110110111011…
…011000000110100010010011
3112102111212101212122110200112
4121000312323120012202103
5103404401232044310232
61025545543332511535
732112653563626554
oct3100667330064223
9472455355573615
10110010141010067
1132064047707151
121040885177b5ab
13494cbb126092c
141d2473aacc32b
15cab939b764b2
hex640dbb606893

110010141010067 has 2 divisors, whose sum is σ = 110010141010068. Its totient is φ = 110010141010066.

The previous prime is 110010141009961. The next prime is 110010141010073. The reversal of 110010141010067 is 760010141010011.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110010141010067 is a prime.

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

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

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

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

Almost surely, 2110010141010067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 23.

Adding to 110010141010067 its reverse (760010141010011), we get a palindrome (870020282020078).

The spelling of 110010141010067 in words is "one hundred ten trillion, ten billion, one hundred forty-one million, ten thousand, sixty-seven".