Base | Representation |
---|---|
bin | 11001000010010100111110… |
… | …001100011010111100001110 |
3 | 112102212112001021110012202212 |
4 | 121002110332030122330032 |
5 | 103413030033210323042 |
6 | 1030104203351150422 |
7 | 32123160126156344 |
oct | 3102247614327416 |
9 | 472775037405685 |
10 | 110111120011022 |
11 | 320a2955723149 |
12 | 10424333375412 |
13 | 4959584837480 |
14 | 1d29599b91994 |
15 | cae399ce5482 |
hex | 64253e31af0e |
110111120011022 has 64 divisors (see below), whose sum is σ = 179303345020800. Its totient is φ = 50412637716480.
The previous prime is 110111120010977. The next prime is 110111120011069. The reversal of 110111120011022 is 220110021111011.
It is a junction number, because it is equal to n+sod(n) for n = 110111120010988 and 110111120011006.
It is a congruent number.
It is an unprimeable number.
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, 12276851354 + ... + 12276860322.
It is an arithmetic number, because the mean of its divisors is an integer number (2801614765950).
Almost surely, 2110111120011022 is an apocalyptic number.
110111120011022 is a deficient number, since it is larger than the sum of its proper divisors (69192225009778).
110111120011022 is a wasteful number, since it uses less digits than its factorization.
110111120011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13821.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110111120011022 its reverse (220110021111011), we get a palindrome (330221141122033).
The spelling of 110111120011022 in words is "one hundred ten trillion, one hundred eleven billion, one hundred twenty million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •