Base | Representation |
---|---|
bin | 1001101001100101101101… |
… | …00110100101110101110110 |
3 | 2210010122001100211011021200 |
4 | 10310302312212211311312 |
5 | 10240132433203341042 |
6 | 113044232021553330 |
7 | 4320052250006106 |
oct | 464626646456566 |
9 | 83118040734250 |
10 | 21220202012022 |
11 | 684148990a832 |
12 | 246874a875846 |
13 | bac0970863c0 |
14 | 5350c5815206 |
15 | 26bebd3e2c4c |
hex | 134cb69a5d76 |
21220202012022 has 24 divisors (see below), whose sum is σ = 49513804695264. Its totient is φ = 6529292926704.
The previous prime is 21220202011997. The next prime is 21220202012033. The reversal of 21220202012022 is 22021020202212.
21220202012022 is a `hidden beast` number, since 21 + 220 + 20 + 201 + 202 + 2 = 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 = 21220202011986 and 21220202012004.
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, 45342311758 + ... + 45342312225.
It is an arithmetic number, because the mean of its divisors is an integer number (2063075195636).
Almost surely, 221220202012022 is an apocalyptic number.
21220202012022 is an abundant number, since it is smaller than the sum of its proper divisors (28293602683242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220202012022 is a wasteful number, since it uses less digits than its factorization.
21220202012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90684624004 (or 90684624001 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 21220202012022 its reverse (22021020202212), we get a palindrome (43241222214234).
The spelling of 21220202012022 in words is "twenty-one trillion, two hundred twenty billion, two hundred two million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •