Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …001111111101011000100101 |
3 | 111021000000212111000022122200 |
4 | 112333112020033331120211 |
5 | 101223042001404000401 |
6 | 555013202130045113 |
7 | 30203651544020220 |
oct | 2677261017753045 |
9 | 437000774008580 |
10 | 101110111000101 |
11 | 2a2426147a71a5 |
12 | b40b997719799 |
13 | 4455847903cc8 |
14 | 1ad7a810945b7 |
15 | ba518cc57686 |
hex | 5bf5883fd625 |
101110111000101 has 24 divisors (see below), whose sum is σ = 175696767654720. Its totient is φ = 54736300691136.
The previous prime is 101110111000081. The next prime is 101110111000127. The reversal of 101110111000101 is 101000111011101.
It is not a de Polignac number, because 101110111000101 - 26 = 101110111000037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110111000501) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42234798720 + ... + 42234801113.
It is an arithmetic number, because the mean of its divisors is an integer number (7320698652280).
Almost surely, 2101110111000101 is an apocalyptic number.
It is an amenable number.
101110111000101 is a deficient number, since it is larger than the sum of its proper divisors (74586656654619).
101110111000101 is a wasteful number, since it uses less digits than its factorization.
101110111000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84469599865 (or 84469599862 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101110111000101 its reverse (101000111011101), we get a palindrome (202110222011202).
The spelling of 101110111000101 in words is "one hundred one trillion, one hundred ten billion, one hundred eleven million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •