Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …1101110110110010011 |
3 | 202021110202201210201221 |
4 | 3011202101232312103 |
5 | 11433341131304021 |
6 | 241234410305511 |
7 | 21216043030603 |
oct | 3054221566623 |
9 | 667422653657 |
10 | 212102213011 |
11 | 81a52195a37 |
12 | 35134728297 |
13 | 170026c0870 |
14 | a3a1508c03 |
15 | 57b5b85241 |
hex | 316246ed93 |
212102213011 has 64 divisors (see below), whose sum is σ = 247005158400. Its totient is φ = 180512064000.
The previous prime is 212102213003. The next prime is 212102213051. The reversal of 212102213011 is 110312201212.
212102213011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 212102213011 - 23 = 212102213003 is a prime.
It is a super-2 number, since 2×2121022130112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (212102213051) 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, 483148330 + ... + 483148768.
It is an arithmetic number, because the mean of its divisors is an integer number (3859455600).
Almost surely, 2212102213011 is an apocalyptic number.
212102213011 is a deficient number, since it is larger than the sum of its proper divisors (34902945389).
212102213011 is a wasteful number, since it uses less digits than its factorization.
212102213011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 212102213011 its reverse (110312201212), we get a palindrome (322414414223).
The spelling of 212102213011 in words is "two hundred twelve billion, one hundred two million, two hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •