Base | Representation |
---|---|
bin | 11001010000101110000010… |
… | …100110001101011010010000 |
3 | 112120101001210200210012210202 |
4 | 121100232002212031122100 |
5 | 104030231011141200422 |
6 | 1032142404101114332 |
7 | 32254501204213640 |
oct | 3120560246153220 |
9 | 476331720705722 |
10 | 111100110100112 |
11 | 32444323861011 |
12 | 10563b420b89a8 |
13 | 49cb906b18513 |
14 | 1d613b9ca8520 |
15 | cc9e7ebb0b92 |
hex | 650b8298d690 |
111100110100112 has 40 divisors (see below), whose sum is σ = 246009375183936. Its totient is φ = 47613948022656.
The previous prime is 111100110100073. The next prime is 111100110100141. The reversal of 111100110100112 is 211001011001111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 111100110100093 and 111100110100102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10130198 + ... + 18022794.
Almost surely, 2111100110100112 is an apocalyptic number.
It is an amenable number.
111100110100112 is an abundant number, since it is smaller than the sum of its proper divisors (134909265083824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111100110100112 is a wasteful number, since it uses less digits than its factorization.
111100110100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8018295 (or 8018289 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 111100110100112 its reverse (211001011001111), we get a palindrome (322101121101223).
Subtracting 111100110100112 from its reverse (211001011001111), we obtain a palindrome (99900900900999).
The spelling of 111100110100112 in words is "one hundred eleven trillion, one hundred billion, one hundred ten million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •