Base | Representation |
---|---|
bin | 1100010110001011010… |
… | …0011110110001100011 |
3 | 202021111101212121012201 |
4 | 3011202310132301203 |
5 | 11433400444302321 |
6 | 241235333434031 |
7 | 21216213330205 |
oct | 3054264366143 |
9 | 667441777181 |
10 | 212111322211 |
11 | 81a573478a8 |
12 | 3513779b917 |
13 | 1700455cb19 |
14 | a3a27da775 |
15 | 57b6884291 |
hex | 3162d1ec63 |
212111322211 has 8 divisors (see below), whose sum is σ = 215225360640. Its totient is φ = 209018984832.
The previous prime is 212111322209. The next prime is 212111322239. The reversal of 212111322211 is 112223111212.
212111322211 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 212111322211 - 21 = 212111322209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212111325211) 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, 5405571 + ... + 5444668.
It is an arithmetic number, because the mean of its divisors is an integer number (26903170080).
Almost surely, 2212111322211 is an apocalyptic number.
212111322211 is a deficient number, since it is larger than the sum of its proper divisors (3114038429).
212111322211 is a wasteful number, since it uses less digits than its factorization.
212111322211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10850525.
The product of its digits is 96, while the sum is 19.
Adding to 212111322211 its reverse (112223111212), we get a palindrome (324334433423).
The spelling of 212111322211 in words is "two hundred twelve billion, one hundred eleven million, three hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •