Base | Representation |
---|---|
bin | 11001000011110010001100… |
… | …101111101000001110001000 |
3 | 112110020002102120012210000101 |
4 | 121003302030233220032020 |
5 | 103421200040330023422 |
6 | 1030222200402415144 |
7 | 32133332553034633 |
oct | 3103621457501610 |
9 | 473202376183011 |
10 | 110211222111112 |
11 | 32131353754591 |
12 | 1043b80b3614b4 |
13 | 4965b48544565 |
14 | 1d303745ccc1a |
15 | cb1ca7e9bc27 |
hex | 643c8cbe8388 |
110211222111112 has 16 divisors (see below), whose sum is σ = 208132703629200. Its totient is φ = 54709167810000.
The previous prime is 110211222111071. The next prime is 110211222111119. The reversal of 110211222111112 is 211111222112011.
It is a super-2 number, since 2×1102112221111122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110211222111112.
It is not an unprimeable number, because it can be changed into a prime (110211222111119) 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, 49555404514 + ... + 49555406737.
It is an arithmetic number, because the mean of its divisors is an integer number (13008293976825).
Almost surely, 2110211222111112 is an apocalyptic number.
It is an amenable number.
110211222111112 is a deficient number, since it is larger than the sum of its proper divisors (97921481518088).
110211222111112 is a wasteful number, since it uses less digits than its factorization.
110211222111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99110811396 (or 99110811392 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 110211222111112 its reverse (211111222112011), we get a palindrome (321322444223123).
The spelling of 110211222111112 in words is "one hundred ten trillion, two hundred eleven billion, two hundred twenty-two million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •