Base | Representation |
---|---|
bin | 1100010110001011000… |
… | …0001111010010100011 |
3 | 202021111022210002211112 |
4 | 3011202300033102203 |
5 | 11433400203211321 |
6 | 241235253533535 |
7 | 21216201016214 |
oct | 3054260172243 |
9 | 667438702745 |
10 | 212110210211 |
11 | 81a56758399 |
12 | 351373442ab |
13 | 17004260933 |
14 | a3a25cb40b |
15 | 57b6714a5b |
hex | 3162c0f4a3 |
212110210211 has 8 divisors (see below), whose sum is σ = 215337483600. Its totient is φ = 208884744288.
The previous prime is 212110210199. The next prime is 212110210223. The reversal of 212110210211 is 112012011212.
It is an interprime number because it is at equal distance from previous prime (212110210199) and next prime (212110210223).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212110210211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212110216211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214436 + ... + 685713.
It is an arithmetic number, because the mean of its divisors is an integer number (26917185450).
Almost surely, 2212110210211 is an apocalyptic number.
212110210211 is a deficient number, since it is larger than the sum of its proper divisors (3227273389).
212110210211 is an equidigital number, since it uses as much as digits as its factorization.
212110210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903733.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212110210211 its reverse (112012011212), we get a palindrome (324122221423).
The spelling of 212110210211 in words is "two hundred twelve billion, one hundred ten million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •