Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100101011010000001000 |
3 | 111020222011100112021012112202 |
4 | 112333031221030223100020 |
5 | 101222414322012023422 |
6 | 555005054104055332 |
7 | 30203210013522521 |
oct | 2677155114532010 |
9 | 436864315235482 |
10 | 101101000111112 |
11 | 2a239769957481 |
12 | b40a074464548 |
13 | 4454a25199b31 |
14 | 1ad7459055848 |
15 | ba4d07e74b92 |
hex | 5bf36932b408 |
101101000111112 has 64 divisors (see below), whose sum is σ = 192066404040000. Its totient is φ = 49887854463744.
The previous prime is 101101000111093. The next prime is 101101000111123. The reversal of 101101000111112 is 211111000101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000111093 and 101101000111102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 645567314 + ... + 645723902.
It is an arithmetic number, because the mean of its divisors is an integer number (3001037563125).
Almost surely, 2101101000111112 is an apocalyptic number.
It is an amenable number.
101101000111112 is a deficient number, since it is larger than the sum of its proper divisors (90965403928888).
101101000111112 is a wasteful number, since it uses less digits than its factorization.
101101000111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160230 (or 160226 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101101000111112 its reverse (211111000101101), we get a palindrome (312212000212213).
The spelling of 101101000111112 in words is "one hundred one trillion, one hundred one billion, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •