Base | Representation |
---|---|
bin | 1100010010110100011… |
… | …1000011000111110110 |
3 | 202012011121021212101120 |
4 | 3010231013003013312 |
5 | 11430024304020042 |
6 | 241010104004410 |
7 | 21154662151134 |
oct | 3045507030766 |
9 | 665147255346 |
10 | 211210220022 |
11 | 8163473244a |
12 | 34b25a60706 |
13 | 16bbc96b869 |
14 | a318c74754 |
15 | 57626dadec |
hex | 312d1c31f6 |
211210220022 has 16 divisors (see below), whose sum is σ = 422576289792. Its totient is φ = 70377431720.
The previous prime is 211210219999. The next prime is 211210220027. The reversal of 211210220022 is 220022012112.
211210220022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 211210219983 and 211210220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211210220027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6476118 + ... + 6508649.
It is an arithmetic number, because the mean of its divisors is an integer number (26411018112).
Almost surely, 2211210220022 is an apocalyptic number.
211210220022 is an abundant number, since it is smaller than the sum of its proper divisors (211366069770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210220022 is a wasteful number, since it uses less digits than its factorization.
211210220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12987483.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 211210220022 its reverse (220022012112), we get a palindrome (431232232134).
The spelling of 211210220022 in words is "two hundred eleven billion, two hundred ten million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •