Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001010000110110110010011 |
3 | 111020222011121111102012220100 |
4 | 112333031233022012312103 |
5 | 101222420023111213021 |
6 | 555005112035143443 |
7 | 30203212336443333 |
oct | 2677155712066623 |
9 | 436864544365810 |
10 | 101101100101011 |
11 | 2a23981034135a |
12 | b40a0a1a44b83 |
13 | 4454a3cb08b5a |
14 | 1ad74684430c3 |
15 | ba4d11b26626 |
hex | 5bf36f286d93 |
101101100101011 has 12 divisors (see below), whose sum is σ = 146063562348600. Its totient is φ = 67387514948160.
The previous prime is 101101100101007. The next prime is 101101100101013. The reversal of 101101100101011 is 110101001101101.
It is not a de Polignac number, because 101101100101011 - 22 = 101101100101007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101101100100984 and 101101100101002.
It is not an unprimeable number, because it can be changed into a prime (101101100101013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1101489270 + ... + 1101581051.
It is an arithmetic number, because the mean of its divisors is an integer number (12171963529050).
Almost surely, 2101101100101011 is an apocalyptic number.
101101100101011 is a deficient number, since it is larger than the sum of its proper divisors (44962462247589).
101101100101011 is a wasteful number, since it uses less digits than its factorization.
101101100101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2203075426 (or 2203075423 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101101100101011 its reverse (110101001101101), we get a palindrome (211202101202112).
The spelling of 101101100101011 in words is "one hundred one trillion, one hundred one billion, one hundred million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •