Base | Representation |
---|---|
bin | 1100010110001011001… |
… | …1010000010110111101 |
3 | 202021111101021021121210 |
4 | 3011202303100112331 |
5 | 11433400404013041 |
6 | 241235322515033 |
7 | 21216210521613 |
oct | 3054263202675 |
9 | 667441237553 |
10 | 212111001021 |
11 | 81a57148557 |
12 | 35137665a79 |
13 | 1700447987a |
14 | a3a27556b3 |
15 | 57b681e016 |
hex | 3162cd05bd |
212111001021 has 32 divisors (see below), whose sum is σ = 298333451520. Its totient is φ = 133866432000.
The previous prime is 212111001001. The next prime is 212111001029. The reversal of 212111001021 is 120100111212.
212111001021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212111001021 - 25 = 212111000989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212111000988 and 212111001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212111001029) 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 31 ways as a sum of consecutive naturals, for example, 787881 + ... + 1022241.
It is an arithmetic number, because the mean of its divisors is an integer number (9322920360).
Almost surely, 2212111001021 is an apocalyptic number.
It is an amenable number.
212111001021 is a deficient number, since it is larger than the sum of its proper divisors (86222450499).
212111001021 is a wasteful number, since it uses less digits than its factorization.
212111001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234597.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 212111001021 its reverse (120100111212), we get a palindrome (332211112233).
The spelling of 212111001021 in words is "two hundred twelve billion, one hundred eleven million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •