Base | Representation |
---|---|
bin | 11001000011110010001100… |
… | …000101001111110100100010 |
3 | 112110020002101210022022222021 |
4 | 121003302030011033310202 |
5 | 103421200030004013442 |
6 | 1030222155324332054 |
7 | 32133332356433200 |
oct | 3103621405176442 |
9 | 473202353268867 |
10 | 110211211001122 |
11 | 32131348456480 |
12 | 1043b8076a402a |
13 | 4965b461546ba |
14 | 1d30372d3a070 |
15 | cb1ca7004e67 |
hex | 643c8c14fd22 |
110211211001122 has 48 divisors (see below), whose sum is σ = 211866927480000. Its totient is φ = 42514289916000.
The previous prime is 110211211001119. The next prime is 110211211001131. The reversal of 110211211001122 is 221100112112011.
It is a super-2 number, since 2×1102112110011222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110211211001096 and 110211211001105.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 506013622 + ... + 506231377.
It is an arithmetic number, because the mean of its divisors is an integer number (4413894322500).
Almost surely, 2110211211001122 is an apocalyptic number.
110211211001122 is a deficient number, since it is larger than the sum of its proper divisors (101655716478878).
110211211001122 is a wasteful number, since it uses less digits than its factorization.
110211211001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012245127 (or 1012245120 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110211211001122 its reverse (221100112112011), we get a palindrome (331311323113133).
The spelling of 110211211001122 in words is "one hundred ten trillion, two hundred eleven billion, two hundred eleven million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •