Base | Representation |
---|---|
bin | 1001100011100000011011… |
… | …10101101110100001010110 |
3 | 2202101122121111121201002021 |
4 | 10301300031311232201112 |
5 | 10223221430310400042 |
6 | 112404230113003354 |
7 | 4266003265632502 |
oct | 461601565564126 |
9 | 82348544551067 |
10 | 21011212200022 |
11 | 6770894586840 |
12 | 243414455355a |
13 | b9546c443255 |
14 | 528d3b811302 |
15 | 26683ab05867 |
hex | 131c0dd6e856 |
21011212200022 has 32 divisors (see below), whose sum is σ = 34475886086400. Its totient is φ = 9524469546720.
The previous prime is 21011212200001. The next prime is 21011212200029. The reversal of 21011212200022 is 22000221211012.
It is a happy number.
It is a super-2 number, since 2×210112122000222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21011212199969 and 21011212200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011212200029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 203153479 + ... + 203256877.
It is an arithmetic number, because the mean of its divisors is an integer number (1077371440200).
Almost surely, 221011212200022 is an apocalyptic number.
21011212200022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21011212200022 is a deficient number, since it is larger than the sum of its proper divisors (13464673886378).
21011212200022 is a wasteful number, since it uses less digits than its factorization.
21011212200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128548.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21011212200022 its reverse (22000221211012), we get a palindrome (43011433411034).
The spelling of 21011212200022 in words is "twenty-one trillion, eleven billion, two hundred twelve million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •