Base | Representation |
---|---|
bin | 1001100110101110110101… |
… | …00000000001011011111100 |
3 | 2202210020121220002021220022 |
4 | 10303113122200001123330 |
5 | 10232030344111201022 |
6 | 112531153321111312 |
7 | 4310005226605220 |
oct | 463273240013374 |
9 | 82706556067808 |
10 | 21122020022012 |
11 | 680388671a528 |
12 | 2451709928538 |
13 | ba2a4b101420 |
14 | 53044ddd8780 |
15 | 269673abcc42 |
hex | 1335da8016fc |
21122020022012 has 48 divisors (see below), whose sum is σ = 45628577641920. Its totient is φ = 8331168771072.
The previous prime is 21122020022003. The next prime is 21122020022021. The reversal of 21122020022012 is 21022002022112.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (21122020022003) and next prime (21122020022021).
It is a super-2 number, since 2×211220200220122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85971587 + ... + 86216922.
It is an arithmetic number, because the mean of its divisors is an integer number (950595367540).
Almost surely, 221122020022012 is an apocalyptic number.
It is an amenable number.
21122020022012 is an abundant number, since it is smaller than the sum of its proper divisors (24506557619908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21122020022012 is a wasteful number, since it uses less digits than its factorization.
21122020022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172188870 (or 172188868 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 21122020022012 its reverse (21022002022112), we get a palindrome (42144022044124).
The spelling of 21122020022012 in words is "twenty-one trillion, one hundred twenty-two billion, twenty million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •