Base | Representation |
---|---|
bin | 11001011101110100001110… |
… | …110101100100010001010011 |
3 | 112200120002212022110011000102 |
4 | 121131310032311210101103 |
5 | 104140002211420213021 |
6 | 1034112050222043015 |
7 | 32406512106413360 |
oct | 3135641665442123 |
9 | 480502768404012 |
10 | 112000111101011 |
11 | 32760a869748a1 |
12 | 1068a45671946b |
13 | 4a65746865073 |
14 | 1d92b97471467 |
15 | ce35a733900b |
hex | 65dd0ed64453 |
112000111101011 has 8 divisors (see below), whose sum is σ = 128024264319744. Its totient is φ = 95981992219080.
The previous prime is 112000111101001. The next prime is 112000111101017. The reversal of 112000111101011 is 110101111000211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112000111101011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112000111100983 and 112000111101001.
It is not an unprimeable number, because it can be changed into a prime (112000111101017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1508544425 + ... + 1508618666.
It is an arithmetic number, because the mean of its divisors is an integer number (16003033039968).
Almost surely, 2112000111101011 is an apocalyptic number.
112000111101011 is a deficient number, since it is larger than the sum of its proper divisors (16024153218733).
112000111101011 is an equidigital number, since it uses as much as digits as its factorization.
112000111101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3017168401.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 112000111101011 its reverse (110101111000211), we get a palindrome (222101222101222).
The spelling of 112000111101011 in words is "one hundred twelve trillion, one hundred eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •