Base | Representation |
---|---|
bin | 11101011001011110000… |
… | …010000000000110001110 |
3 | 21011010112001200121111121 |
4 | 131121132002000012032 |
5 | 231044343311241420 |
6 | 4144023410511154 |
7 | 265645512321121 |
oct | 35313602000616 |
9 | 7133461617447 |
10 | 2020212212110 |
11 | 709849143a14 |
12 | 287644b954ba |
13 | 118674bb09b1 |
14 | 6dac90163b8 |
15 | 3783c6b62aa |
hex | 1d65e08018e |
2020212212110 has 64 divisors (see below), whose sum is σ = 3878227745280. Its totient is φ = 756076604800.
The previous prime is 2020212212101. The next prime is 2020212212119. The reversal of 2020212212110 is 112122120202.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2020212212101) and next prime (2020212212119).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020212212119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1404201 + ... + 2451979.
It is an arithmetic number, because the mean of its divisors is an integer number (60597308520).
Almost surely, 22020212212110 is an apocalyptic number.
2020212212110 is a deficient number, since it is larger than the sum of its proper divisors (1858015533170).
2020212212110 is a wasteful number, since it uses less digits than its factorization.
2020212212110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047993.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2020212212110 its reverse (112122120202), we get a palindrome (2132334332312).
It can be divided in two parts, 2020212 and 212110, that added together give a palindrome (2232322).
The spelling of 2020212212110 in words is "two trillion, twenty billion, two hundred twelve million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •