Search a number
BaseRepresentation
bin10110111101111000111001…
…001011001011101100001111
3111020122110110120200200012221
4112331320321023023230033
5101214421440011200421
6554455204202040211
730163505652301144
oct2675707113135417
9436573416620187
10101010000100111
112a204111805313
12b3b44b87a9067
13444928213568b
15ba277de13841
hex5bde392cbb0f

101010000100111 has 2 divisors, whose sum is σ = 101010000100112. Its totient is φ = 101010000100110.

The previous prime is 101010000100081. The next prime is 101010000100213. The reversal of 101010000100111 is 111001000010101.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101010000100111 - 213 = 101010000091919 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101010000100111 is an apocalyptic number.

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

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

101010000100111 is an evil number, because the sum of its binary digits is even.

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

Adding to 101010000100111 its reverse (111001000010101), we get a palindrome (212011000110212).

The spelling of 101010000100111 in words is "one hundred one trillion, ten billion, one hundred thousand, one hundred eleven".