Base | Representation |
---|---|
bin | 11001100000111001101011… |
… | …000010010000101011100110 |
3 | 112201022101001222021122000011 |
4 | 121200321223002100223212 |
5 | 104201440401000030042 |
6 | 1034353310550440434 |
7 | 32431025503546654 |
oct | 3140715302205346 |
9 | 481271058248004 |
10 | 112212111330022 |
11 | 32832986533730 |
12 | 1070356106311a |
13 | 4a7c731099062 |
14 | 1d9d1491cddd4 |
15 | ce8d64076a17 |
hex | 660e6b090ae6 |
112212111330022 has 64 divisors (see below), whose sum is σ = 189364334229504. Its totient is φ = 49431908413440.
The previous prime is 112212111329993. The next prime is 112212111330037. The reversal of 112212111330022 is 220033111212211.
It is a happy number.
112212111330022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 112212111329975 and 112212111330002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123751318 + ... + 124654774.
It is an arithmetic number, because the mean of its divisors is an integer number (2958817722336).
Almost surely, 2112212111330022 is an apocalyptic number.
112212111330022 is a deficient number, since it is larger than the sum of its proper divisors (77152222899482).
112212111330022 is a wasteful number, since it uses less digits than its factorization.
112212111330022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904693.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 112212111330022 its reverse (220033111212211), we get a palindrome (332245222542233).
The spelling of 112212111330022 in words is "one hundred twelve trillion, two hundred twelve billion, one hundred eleven million, three hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •