Search a number
-
+
110002202100101 is a prime number
BaseRepresentation
bin11001000000101111100010…
…001011100100000110000101
3112102111002220121012001120002
4121000233202023210012011
5103404234002214200401
61025542151454251045
732112253054203503
oct3100574213440605
9472432817161502
10110002202100101
1132060743374633
12104071b6ab6a85
13494c21758997c
141d241c65a7673
15cab622be6a6b
hex640be22e4185

110002202100101 has 2 divisors, whose sum is σ = 110002202100102. Its totient is φ = 110002202100100.

The previous prime is 110002202100061. The next prime is 110002202100113. The reversal of 110002202100101 is 101001202200011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 103147890630625 + 6854311469476 = 10156175^2 + 2618074^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2110002202100101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 110002202100101 its reverse (101001202200011), we get a palindrome (211003404300112).

The spelling of 110002202100101 in words is "one hundred ten trillion, two billion, two hundred two million, one hundred thousand, one hundred one".