Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …000011000001000001001110 |
3 | 112120101001112001000021022110 |
4 | 121100231330003001001032 |
5 | 104030230300023223042 |
6 | 1032142345133524450 |
7 | 32254465401163404 |
oct | 3120557403010116 |
9 | 476331461007273 |
10 | 111100000211022 |
11 | 32444277825789 |
12 | 10563b11343726 |
13 | 49cb8ba1217a4 |
14 | 1d613a9461474 |
15 | cc9e7520609c |
hex | 650b7c0c104e |
111100000211022 has 64 divisors (see below), whose sum is σ = 230927790510144. Its totient is φ = 35605118315520.
The previous prime is 111100000210943. The next prime is 111100000211027. The reversal of 111100000211022 is 220112000001111.
It is a junction number, because it is equal to n+sod(n) for n = 111100000210989 and 111100000211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100000211027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2496903 + ... + 15114050.
It is an arithmetic number, because the mean of its divisors is an integer number (3608246726721).
Almost surely, 2111100000211022 is an apocalyptic number.
111100000211022 is an abundant number, since it is smaller than the sum of its proper divisors (119827790299122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111100000211022 is a wasteful number, since it uses less digits than its factorization.
111100000211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17611333.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111100000211022 its reverse (220112000001111), we get a palindrome (331212000212133).
The spelling of 111100000211022 in words is "one hundred eleven trillion, one hundred billion, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •