Base | Representation |
---|---|
bin | 1100010010000100101… |
… | …1010001110010111111 |
3 | 202011122122112202001101 |
4 | 3010201023101302333 |
5 | 11424122030031421 |
6 | 240534152353531 |
7 | 21150011265346 |
oct | 3044113216277 |
9 | 664578482041 |
10 | 211010002111 |
11 | 815417107a7 |
12 | 34a8a9a58a7 |
13 | 16b8a33931c |
14 | a2da436b5d |
15 | 574ed3c191 |
hex | 31212d1cbf |
211010002111 has 8 divisors (see below), whose sum is σ = 217476642240. Its totient is φ = 204625739808.
The previous prime is 211010002103. The next prime is 211010002123. The reversal of 211010002111 is 111200010112.
211010002111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211010002111 - 23 = 211010002103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211010002171) 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 7 ways as a sum of consecutive naturals, for example, 20589256 + ... + 20599501.
It is an arithmetic number, because the mean of its divisors is an integer number (27184580280).
Almost surely, 2211010002111 is an apocalyptic number.
211010002111 is a deficient number, since it is larger than the sum of its proper divisors (6466640129).
211010002111 is a wasteful number, since it uses less digits than its factorization.
211010002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41188913.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211010002111 its reverse (111200010112), we get a palindrome (322210012223).
The spelling of 211010002111 in words is "two hundred eleven billion, ten million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •