Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011010101011011011000 |
3 | 112120102000100122012021220202 |
4 | 121100313100223111123120 |
5 | 104030411300030013422 |
6 | 1032151122310241332 |
7 | 32255301425042033 |
oct | 3120672053253330 |
9 | 476360318167822 |
10 | 111110010001112 |
11 | 32448544017181 |
12 | 10565a45656248 |
13 | 49cc823b590c5 |
14 | 1d61a78a1201a |
15 | cca35dd99b92 |
hex | 650dd0ad56d8 |
111110010001112 has 8 divisors (see below), whose sum is σ = 208331268752100. Its totient is φ = 55555005000552.
The previous prime is 111110010001103. The next prime is 111110010001139. The reversal of 111110010001112 is 211100010011111.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 111110010001093 and 111110010001102.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 6944375625062 + ... + 6944375625077.
Almost surely, 2111110010001112 is an apocalyptic number.
It is an amenable number.
111110010001112 is a deficient number, since it is larger than the sum of its proper divisors (97221258750988).
111110010001112 is a wasteful number, since it uses less digits than its factorization.
111110010001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13888751250145 (or 13888751250141 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 111110010001112 its reverse (211100010011111), we get a palindrome (322210020012223).
Subtracting 111110010001112 from its reverse (211100010011111), we obtain a palindrome (99990000009999).
The spelling of 111110010001112 in words is "one hundred eleven trillion, one hundred ten billion, ten million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •