Base | Representation |
---|---|
bin | 1100010010110010011… |
… | …1101100110001100110 |
3 | 202012011000211100102012 |
4 | 3010230213230301212 |
5 | 11430020203031042 |
6 | 241005211514222 |
7 | 21154532253014 |
oct | 3045447546146 |
9 | 665130740365 |
10 | 211202002022 |
11 | 8163002a110 |
12 | 34b23158972 |
13 | 16bbb05213b |
14 | a317b358b4 |
15 | 5761b15e82 |
hex | 312c9ecc66 |
211202002022 has 128 divisors (see below), whose sum is σ = 368526412800. Its totient is φ = 89929728000.
The previous prime is 211202002021. The next prime is 211202002091. The reversal of 211202002022 is 220200202112.
211202002022 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 = 211202001988 and 211202002006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211202002021) 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 63 ways as a sum of consecutive naturals, for example, 470382854 + ... + 470383302.
It is an arithmetic number, because the mean of its divisors is an integer number (2879112600).
Almost surely, 2211202002022 is an apocalyptic number.
211202002022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211202002022 is a deficient number, since it is larger than the sum of its proper divisors (157324410778).
211202002022 is a wasteful number, since it uses less digits than its factorization.
211202002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 211202002022 its reverse (220200202112), we get a palindrome (431402204134).
The spelling of 211202002022 in words is "two hundred eleven billion, two hundred two million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •