Base | Representation |
---|---|
bin | 1001100110101111000000… |
… | …11110001101011001011100 |
3 | 2202210020212212121100222222 |
4 | 10303113200132031121130 |
5 | 10232031100233210022 |
6 | 112531211300324512 |
7 | 4310010554312423 |
oct | 463274036153134 |
9 | 82706785540888 |
10 | 21122120210012 |
11 | 680392822a228 |
12 | 24517373a3738 |
13 | ba2a65aac673 |
14 | 53045d4382ba |
15 | 26967c7ad242 |
hex | 1335e078d65c |
21122120210012 has 96 divisors (see below), whose sum is σ = 38626828800000. Its totient is φ = 10095157163520.
The previous prime is 21122120209997. The next prime is 21122120210027. The reversal of 21122120210012 is 21001202122112.
It is an interprime number because it is at equal distance from previous prime (21122120209997) and next prime (21122120210027).
It is a super-2 number, since 2×211221202100122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6582148664 + ... + 6582151872.
It is an arithmetic number, because the mean of its divisors is an integer number (402362800000).
Almost surely, 221122120210012 is an apocalyptic number.
It is an amenable number.
21122120210012 is a deficient number, since it is larger than the sum of its proper divisors (17504708589988).
21122120210012 is a wasteful number, since it uses less digits than its factorization.
21122120210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5299 (or 5297 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21122120210012 its reverse (21001202122112), we get a palindrome (42123322332124).
The spelling of 21122120210012 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred twenty million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •