Search a number
-
+
110101010000117 is a prime number
BaseRepresentation
bin11001000010001011100011…
…100101110010100011110101
3112102211112221200200110001112
4121002023203211302203311
5103412343332030000432
61030055412234404405
732122351444406033
oct3102134345624365
9472745850613045
10110101010000117
11320996378aa334
1210422391590705
13495863310c9b6
141d28cbb193553
15cadea74567b2
hex6422e39728f5

110101010000117 has 2 divisors, whose sum is σ = 110101010000118. Its totient is φ = 110101010000116.

The previous prime is 110101010000081. The next prime is 110101010000143. The reversal of 110101010000117 is 711000010101011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109727950462321 + 373059537796 = 10475111^2 + 610786^2 .

It is a cyclic number.

It is not a de Polignac number, because 110101010000117 - 28 = 110101009999861 is a prime.

It is a congruent number.

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

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

Almost surely, 2110101010000117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7, while the sum is 14.

Adding to 110101010000117 its reverse (711000010101011), we get a palindrome (821101020101128).

The spelling of 110101010000117 in words is "one hundred ten trillion, one hundred one billion, ten million, one hundred seventeen", and thus it is an aban number.