Base | Representation |
---|---|
bin | 1001101001010100100100… |
… | …01111110000000100001110 |
3 | 2210002202022012120201112222 |
4 | 10310222102033300010032 |
5 | 10240010113020011342 |
6 | 113040111100055342 |
7 | 4316305256100011 |
oct | 464522217600416 |
9 | 83082265521488 |
10 | 21211002110222 |
11 | 68385987a3401 |
12 | 2466a01834552 |
13 | bab25c084722 |
14 | 534891a45378 |
15 | 26bb308caed2 |
hex | 134a923f010e |
21211002110222 has 32 divisors (see below), whose sum is σ = 32042798374752. Its totient is φ = 10530241467264.
The previous prime is 21211002110189. The next prime is 21211002110227. The reversal of 21211002110222 is 22201120011212.
It is a super-2 number, since 2×212110021102222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21211002110222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211002110227) 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 15 ways as a sum of consecutive naturals, for example, 840459788 + ... + 840485024.
It is an arithmetic number, because the mean of its divisors is an integer number (1001337449211).
Almost surely, 221211002110222 is an apocalyptic number.
21211002110222 is a deficient number, since it is larger than the sum of its proper divisors (10831796264530).
21211002110222 is a wasteful number, since it uses less digits than its factorization.
21211002110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28532.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21211002110222 its reverse (22201120011212), we get a palindrome (43412122121434).
The spelling of 21211002110222 in words is "twenty-one trillion, two hundred eleven billion, two million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •