Base | Representation |
---|---|
bin | 1100010101110101101… |
… | …1111110001010100111 |
3 | 202021021002221022200011 |
4 | 3011131123332022213 |
5 | 11433204334323421 |
6 | 241222350031051 |
7 | 21214035600430 |
oct | 3053533761247 |
9 | 667232838604 |
10 | 212021011111 |
11 | 81a10373828 |
12 | 351114a8487 |
13 | 16cbb92c3c0 |
14 | a39480c487 |
15 | 57ad9954e1 |
hex | 315d6fe2a7 |
212021011111 has 16 divisors (see below), whose sum is σ = 276298876224. Its totient is φ = 157885069824.
The previous prime is 212021011109. The next prime is 212021011151. The reversal of 212021011111 is 111110120212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 212021011111 - 21 = 212021011109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 212021011091 and 212021011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212021011151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68524960 + ... + 68528053.
It is an arithmetic number, because the mean of its divisors is an integer number (17268679764).
Almost surely, 2212021011111 is an apocalyptic number.
212021011111 is a deficient number, since it is larger than the sum of its proper divisors (64277865113).
212021011111 is a wasteful number, since it uses less digits than its factorization.
212021011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137053050.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212021011111 its reverse (111110120212), we get a palindrome (323131131323).
The spelling of 212021011111 in words is "two hundred twelve billion, twenty-one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •