Base | Representation |
---|---|
bin | 1100010010011110111… |
… | …1101010000101111111 |
3 | 202011221022220111000212 |
4 | 3010213233222011333 |
5 | 11424333232431421 |
6 | 240553130343035 |
7 | 21152520052220 |
oct | 3044757520577 |
9 | 664838814025 |
10 | 211120202111 |
11 | 81598939685 |
12 | 34abb88aa7b |
13 | 16ba7111720 |
14 | a30ad21247 |
15 | 5759858e5b |
hex | 3127bea17f |
211120202111 has 8 divisors (see below), whose sum is σ = 259840248864. Its totient is φ = 167040159840.
The previous prime is 211120202087. The next prime is 211120202171. The reversal of 211120202111 is 111202021112.
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 211120202111 - 26 = 211120202047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211120202171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1160001020 + ... + 1160001201.
It is an arithmetic number, because the mean of its divisors is an integer number (32480031108).
Almost surely, 2211120202111 is an apocalyptic number.
211120202111 is a deficient number, since it is larger than the sum of its proper divisors (48720046753).
211120202111 is a wasteful number, since it uses less digits than its factorization.
211120202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2320002241.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211120202111 its reverse (111202021112), we get a palindrome (322322223223).
It can be divided in two parts, 2 and 11120202111, that multiplied together give a palindrome (22240404222).
The spelling of 211120202111 in words is "two hundred eleven billion, one hundred twenty million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •