Base | Representation |
---|---|
bin | 11001000010010101111110… |
… | …101100010011100000100011 |
3 | 112102212121211200121120220020 |
4 | 121002111332230103200203 |
5 | 103413034242220023021 |
6 | 1030104503004244523 |
7 | 32123226005650662 |
oct | 3102257654234043 |
9 | 472777750546806 |
10 | 110112202111011 |
11 | 320a3360521961 |
12 | 10424595840743 |
13 | 49596c7a8b819 |
14 | 1d2965d790dd9 |
15 | cae40ece27c6 |
hex | 64257eb13823 |
110112202111011 has 4 divisors (see below), whose sum is σ = 146816269481352. Its totient is φ = 73408134740672.
The previous prime is 110112202110971. The next prime is 110112202111069. The reversal of 110112202111011 is 110111202211011.
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 110112202111011 - 214 = 110112202094627 is a prime.
It is a super-2 number, since 2×1101122021110112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110112202111091) 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, 18352033685166 + ... + 18352033685171.
It is an arithmetic number, because the mean of its divisors is an integer number (36704067370338).
Almost surely, 2110112202111011 is an apocalyptic number.
110112202111011 is a deficient number, since it is larger than the sum of its proper divisors (36704067370341).
110112202111011 is an equidigital number, since it uses as much as digits as its factorization.
110112202111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36704067370340.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 110112202111011 its reverse (110111202211011), we get a palindrome (220223404322022).
The spelling of 110112202111011 in words is "one hundred ten trillion, one hundred twelve billion, two hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •