Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0010110100110100001 |
3 | 202021021010010101222012 |
4 | 3011131130112212201 |
5 | 11433204401024301 |
6 | 241222352122305 |
7 | 21214036465304 |
oct | 3053534264641 |
9 | 667233111865 |
10 | 212021111201 |
11 | 81a10431a49 |
12 | 35111536395 |
13 | 16cbb965b23 |
14 | a394836b3b |
15 | 57ad9b4ebb |
hex | 315d7169a1 |
212021111201 has 2 divisors, whose sum is σ = 212021111202. Its totient is φ = 212021111200.
The previous prime is 212021111189. The next prime is 212021111251. The reversal of 212021111201 is 102111120212.
212021111201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 169492773025 + 42528338176 = 411695^2 + 206224^2 .
It is a cyclic number.
It is not a de Polignac number, because 212021111201 - 222 = 212016916897 is a prime.
It is not a weakly prime, because it can be changed into another prime (212021111251) 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 as a sum of consecutive naturals, namely, 106010555600 + 106010555601.
It is an arithmetic number, because the mean of its divisors is an integer number (106010555601).
Almost surely, 2212021111201 is an apocalyptic number.
It is an amenable number.
212021111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
212021111201 is an equidigital number, since it uses as much as digits as its factorization.
212021111201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212021111201 its reverse (102111120212), we get a palindrome (314132231413).
The spelling of 212021111201 in words is "two hundred twelve billion, twenty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •