Base | Representation |
---|---|
bin | 1100010010011111001… |
… | …1011110010000100011 |
3 | 202011221101210021220121 |
4 | 3010213303132100203 |
5 | 11424334011432321 |
6 | 240553204021111 |
7 | 21152531416033 |
oct | 3044763362043 |
9 | 664841707817 |
10 | 211121202211 |
11 | 81599462007 |
12 | 34b00091797 |
13 | 16ba73a19ba |
14 | a30b1018c3 |
15 | 57599a5441 |
hex | 3127cde423 |
211121202211 has 8 divisors (see below), whose sum is σ = 211380764144. Its totient is φ = 210861792000.
The previous prime is 211121202179. The next prime is 211121202239. The reversal of 211121202211 is 112202121112.
211121202211 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 211121202211 - 25 = 211121202179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211121202251) 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, 2883391 + ... + 2955703.
It is an arithmetic number, because the mean of its divisors is an integer number (26422595518).
Almost surely, 2211121202211 is an apocalyptic number.
211121202211 is a deficient number, since it is larger than the sum of its proper divisors (259561933).
211121202211 is a wasteful number, since it uses less digits than its factorization.
211121202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75861.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211121202211 its reverse (112202121112), we get a palindrome (323323323323).
The spelling of 211121202211 in words is "two hundred eleven billion, one hundred twenty-one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •