Base | Representation |
---|---|
bin | 1001100110011100100011… |
… | …10110010111111100100110 |
3 | 2202202022022022002000102100 |
4 | 10303032101312113330212 |
5 | 10231400302032210042 |
6 | 112522452124152530 |
7 | 4306210163226552 |
oct | 463162166277446 |
9 | 82668268060370 |
10 | 21112211210022 |
11 | 67aa702919939 |
12 | 244b830998746 |
13 | ba1b46c0436a |
14 | 52db9d402862 |
15 | 26929c8c824c |
hex | 133391d97f26 |
21112211210022 has 24 divisors (see below), whose sum is σ = 45761013760176. Its totient is φ = 7034651510256.
The previous prime is 21112211210011. The next prime is 21112211210047. The reversal of 21112211210022 is 22001211221112.
21112211210022 is a `hidden beast` number, since 211 + 1 + 221 + 1 + 210 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21112211209977 and 21112211210004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 229304898 + ... + 229396949.
It is an arithmetic number, because the mean of its divisors is an integer number (1906708906674).
Almost surely, 221112211210022 is an apocalyptic number.
21112211210022 is an abundant number, since it is smaller than the sum of its proper divisors (24648802550154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112211210022 is a wasteful number, since it uses less digits than its factorization.
21112211210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458704412 (or 458704409 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21112211210022 its reverse (22001211221112), we get a palindrome (43113422431134).
The spelling of 21112211210022 in words is "twenty-one trillion, one hundred twelve billion, two hundred eleven million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •