Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …010011000011100001001110 |
3 | 112102111221122120202112110221 |
4 | 121000313233103003201032 |
5 | 103404410023044232342 |
6 | 1025550210011221554 |
7 | 32113014302036050 |
oct | 3100675723034116 |
9 | 472457576675427 |
10 | 110011012102222 |
11 | 32064454394620 |
12 | 10408a554478ba |
13 | 494ccbc87548a |
14 | 1d247c06818d0 |
15 | cab98b392a67 |
hex | 640def4c384e |
110011012102222 has 64 divisors (see below), whose sum is σ = 216565267046400. Its totient is φ = 40605149184480.
The previous prime is 110011012102219. The next prime is 110011012102223. The reversal of 110011012102222 is 222201210110011.
It is a junction number, because it is equal to n+sod(n) for n = 110011012102196 and 110011012102205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011012102223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 544014943 + ... + 544217125.
It is an arithmetic number, because the mean of its divisors is an integer number (3383832297600).
Almost surely, 2110011012102222 is an apocalyptic number.
110011012102222 is a deficient number, since it is larger than the sum of its proper divisors (106554254944178).
110011012102222 is a wasteful number, since it uses less digits than its factorization.
110011012102222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388181.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110011012102222 its reverse (222201210110011), we get a palindrome (332212222212233).
The spelling of 110011012102222 in words is "one hundred ten trillion, eleven billion, twelve million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •