Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …000011111100010010101000 |
3 | 112102212111222221200220210111 |
4 | 121002110331003330102220 |
5 | 103413030013324323422 |
6 | 1030104201432024104 |
7 | 32123156505524125 |
oct | 3102247503742250 |
9 | 472774887626714 |
10 | 110111101011112 |
11 | 320a2945a26243 |
12 | 10424328b32034 |
13 | 4959580914316 |
14 | 1d2959744774c |
15 | cae3982e0a77 |
hex | 64253d0fc4a8 |
110111101011112 has 64 divisors (see below), whose sum is σ = 218116624536000. Its totient is φ = 51968066282496.
The previous prime is 110111101011101. The next prime is 110111101011133. The reversal of 110111101011112 is 211110101111011.
It is a junction number, because it is equal to n+sod(n) for n = 110111101011092 and 110111101011101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56476608 + ... + 58393744.
It is an arithmetic number, because the mean of its divisors is an integer number (3408072258375).
Almost surely, 2110111101011112 is an apocalyptic number.
It is an amenable number.
110111101011112 is a deficient number, since it is larger than the sum of its proper divisors (108005523524888).
110111101011112 is a wasteful number, since it uses less digits than its factorization.
110111101011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1918538 (or 1918534 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 110111101011112 its reverse (211110101111011), we get a palindrome (321221202122123).
The spelling of 110111101011112 in words is "one hundred ten trillion, one hundred eleven billion, one hundred one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •