Base | Representation |
---|---|
bin | 1001100110011100010111… |
… | …10101000110000000110010 |
3 | 2202202022001021000201222100 |
4 | 10303032023311012000302 |
5 | 10231400100203223442 |
6 | 112522434115321230 |
7 | 4306204525604250 |
oct | 463161365060062 |
9 | 82668037021870 |
10 | 21112110211122 |
11 | 67aa660905977 |
12 | 244b802bb0216 |
13 | ba1b2c000cb8 |
14 | 52db8dc315d0 |
15 | 269293ac784c |
hex | 13338bd46032 |
21112110211122 has 72 divisors (see below), whose sum is σ = 54018380115648. Its totient is φ = 5837449794480.
The previous prime is 21112110211111. The next prime is 21112110211169. The reversal of 21112110211122 is 22111201121112.
It is a happy number.
21112110211122 is a `hidden beast` number, since 211 + 12 + 110 + 211 + 122 = 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 = 21112110211095 and 21112110211104.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 87057078 + ... + 87299249.
It is an arithmetic number, because the mean of its divisors is an integer number (750255279384).
Almost surely, 221112110211122 is an apocalyptic number.
21112110211122 is an abundant number, since it is smaller than the sum of its proper divisors (32906269904526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112110211122 is a wasteful number, since it uses less digits than its factorization.
21112110211122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174356404 (or 174356370 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 21112110211122 its reverse (22111201121112), we get a palindrome (43223311332234).
The spelling of 21112110211122 in words is "twenty-one trillion, one hundred twelve billion, one hundred ten million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •