Base | Representation |
---|---|
bin | 1001101001100111011001… |
… | …10110110000100101110110 |
3 | 2210010201101210112111221002 |
4 | 10310303230312300211312 |
5 | 10240141314212020042 |
6 | 113044502214523302 |
7 | 4320113641441541 |
oct | 464635466604566 |
9 | 83121353474832 |
10 | 21221112220022 |
11 | 6841906684550 |
12 | 2468963666532 |
13 | bac1b0815210 |
14 | 53517066b858 |
15 | 26c023289132 |
hex | 134cecdb0976 |
21221112220022 has 64 divisors (see below), whose sum is σ = 38175389501760. Its totient is φ = 8719192934400.
The previous prime is 21221112220013. The next prime is 21221112220027. The reversal of 21221112220022 is 22002221112212.
It is a super-4 number, since 4×212211122200224 (a number of 54 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21221112219976 and 21221112220003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221112220027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6553754 + ... + 9240882.
It is an arithmetic number, because the mean of its divisors is an integer number (596490460965).
Almost surely, 221221112220022 is an apocalyptic number.
21221112220022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21221112220022 is a deficient number, since it is larger than the sum of its proper divisors (16954277281738).
21221112220022 is a wasteful number, since it uses less digits than its factorization.
21221112220022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2687729.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 21221112220022 its reverse (22002221112212), we get a palindrome (43223333332234).
The spelling of 21221112220022 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred twelve million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •