Base | Representation |
---|---|
bin | 11001000010010101111000… |
… | …101011011100011001111011 |
3 | 112102212121120122202220012121 |
4 | 121002111320223130121323 |
5 | 103413034040403101021 |
6 | 1030104445002022111 |
7 | 32123223342263650 |
oct | 3102257053343173 |
9 | 472777518686177 |
10 | 110112101222011 |
11 | 320a3309583519 |
12 | 10424567aa7937 |
13 | 49596acbc64a5 |
14 | 1d2965020bc27 |
15 | cae406014741 |
hex | 642578adc67b |
110112101222011 has 8 divisors (see below), whose sum is σ = 126595948711680. Its totient is φ = 93816640561128.
The previous prime is 110112101222009. The next prime is 110112101222027. The reversal of 110112101222011 is 110222101211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110112101222011 - 21 = 110112101222009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110112101252011) 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, 47096705941 + ... + 47096708278.
It is an arithmetic number, because the mean of its divisors is an integer number (15824493588960).
Almost surely, 2110112101222011 is an apocalyptic number.
110112101222011 is a deficient number, since it is larger than the sum of its proper divisors (16483847489669).
110112101222011 is an equidigital number, since it uses as much as digits as its factorization.
110112101222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94193414393.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110112101222011 its reverse (110222101211011), we get a palindrome (220334202433022).
It can be divided in two parts, 11011210 and 1222011, that added together give a palindrome (12233221).
The spelling of 110112101222011 in words is "one hundred ten trillion, one hundred twelve billion, one hundred one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •