Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …100101101111000100110111 |
3 | 111010002212021221011002211222 |
4 | 112233111210211233010313 |
5 | 101102030440240213421 |
6 | 552411543225020555 |
7 | 30031325026121363 |
oct | 2657254445570467 |
9 | 433085257132758 |
10 | 100010001101111 |
11 | 299590044034a2 |
12 | b27273702475b |
13 | 43a5b9712a65a |
14 | 1a9a71d1802a3 |
15 | b867527e8cab |
hex | 5af56496f137 |
100010001101111 has 2 divisors, whose sum is σ = 100010001101112. Its totient is φ = 100010001101110.
The previous prime is 100010001101081. The next prime is 100010001101113. The reversal of 100010001101111 is 111101100010001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100010001101111 - 230 = 100008927359287 is a prime.
Together with 100010001101113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010001101113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005000550555 + 50005000550556.
It is an arithmetic number, because the mean of its divisors is an integer number (50005000550556).
Almost surely, 2100010001101111 is an apocalyptic number.
100010001101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010001101111 is an equidigital number, since it uses as much as digits as its factorization.
100010001101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100010001101111 its reverse (111101100010001), we get a palindrome (211111101111112).
The spelling of 100010001101111 in words is "one hundred trillion, ten billion, one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •