Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110111100101110100011 |
3 | 111020121121020100121212011022 |
4 | 112331300200232330232203 |
5 | 101214300022012023021 |
6 | 554451115141040055 |
7 | 30163036636533650 |
oct | 2675604056745643 |
9 | 436547210555138 |
10 | 101001000111011 |
11 | 2a2003135212a0 |
12 | b3b28066b602b |
13 | 444847968a340 |
14 | 1ad268ddd4c27 |
15 | ba2403c3a1ab |
hex | 5bdc20bbcba3 |
101001000111011 has 16 divisors (see below), whose sum is σ = 135609734416128. Its totient is φ = 72648072007200.
The previous prime is 101001000110939. The next prime is 101001000111029. The reversal of 101001000111011 is 110111000100101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001000111011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101001000111011.
It is not an unprimeable number, because it can be changed into a prime (101001000111311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50450049005 + ... + 50450051006.
It is an arithmetic number, because the mean of its divisors is an integer number (8475608401008).
Almost surely, 2101001000111011 is an apocalyptic number.
101001000111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101001000111011 is a deficient number, since it is larger than the sum of its proper divisors (34608734305117).
101001000111011 is a wasteful number, since it uses less digits than its factorization.
101001000111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100900100042.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101001000111011 its reverse (110111000100101), we get a palindrome (211112000211112).
The spelling of 101001000111011 in words is "one hundred one trillion, one billion, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •