Base | Representation |
---|---|
bin | 1100010010110100011… |
… | …1000011011010011011 |
3 | 202012011121021221000121 |
4 | 3010231013003122123 |
5 | 11430024304034321 |
6 | 241010104014111 |
7 | 21154662154453 |
oct | 3045507033233 |
9 | 665147257017 |
10 | 211210221211 |
11 | 81634733330 |
12 | 34b25a61337 |
13 | 16bbc96c272 |
14 | a318c74d63 |
15 | 57626db441 |
hex | 312d1c369b |
211210221211 has 4 divisors (see below), whose sum is σ = 230411150424. Its totient is φ = 192009292000.
The previous prime is 211210221197. The next prime is 211210221241. The reversal of 211210221211 is 112122012112.
211210221211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211210221211 - 25 = 211210221179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211210221241) 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 3 ways as a sum of consecutive naturals, for example, 9600464590 + ... + 9600464611.
It is an arithmetic number, because the mean of its divisors is an integer number (57602787606).
Almost surely, 2211210221211 is an apocalyptic number.
211210221211 is a deficient number, since it is larger than the sum of its proper divisors (19200929213).
211210221211 is a wasteful number, since it uses less digits than its factorization.
211210221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19200929212.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211210221211 its reverse (112122012112), we get a palindrome (323332233323).
The spelling of 211210221211 in words is "two hundred eleven billion, two hundred ten million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •