Base | Representation |
---|---|
bin | 11001000010010101111000… |
… | …101011000011100000001011 |
3 | 112102212121120122120201021211 |
4 | 121002111320223003200023 |
5 | 103413034040341320021 |
6 | 1030104444555513551 |
7 | 32123223341360404 |
oct | 3102257053034013 |
9 | 472777518521254 |
10 | 110112101120011 |
11 | 320a3309513921 |
12 | 10424567a588b7 |
13 | 49596acb8bc33 |
14 | 1d296501c29ab |
15 | cae405ee43e1 |
hex | 642578ac380b |
110112101120011 has 4 divisors (see below), whose sum is σ = 111181150645552. Its totient is φ = 109043051594472.
The previous prime is 110112101119997. The next prime is 110112101120023. The reversal of 110112101120011 is 110021101211011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110112101120011 - 27 = 110112101119883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110112101119973 and 110112101120000.
It is not an unprimeable number, because it can be changed into a prime (110112101120041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 534524762616 + ... + 534524762821.
It is an arithmetic number, because the mean of its divisors is an integer number (27795287661388).
Almost surely, 2110112101120011 is an apocalyptic number.
110112101120011 is a deficient number, since it is larger than the sum of its proper divisors (1069049525541).
110112101120011 is a wasteful number, since it uses less digits than its factorization.
110112101120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1069049525540.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110112101120011 its reverse (110021101211011), we get a palindrome (220133202331022).
The spelling of 110112101120011 in words is "one hundred ten trillion, one hundred twelve billion, one hundred one million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •