Base | Representation |
---|---|
bin | 110000000001010111010110… |
… | …010010110101111110011111 |
3 | 1000200210112011200011201202020 |
4 | 300001113112102311332133 |
5 | 210140300121130010421 |
6 | 2025103541205031223 |
7 | 62325461301423126 |
oct | 6001272622657637 |
9 | 1020715150151666 |
10 | 211200022110111 |
11 | 61327476565081 |
12 | 1b82bb900b5513 |
13 | 90b00cc473ab8 |
14 | 3a221c8194abd |
15 | 1963be5ad8dc6 |
hex | c015d64b5f9f |
211200022110111 has 8 divisors (see below), whose sum is σ = 281602380877440. Its totient is φ = 140798839041432.
The previous prime is 211200022110067. The next prime is 211200022110127. The reversal of 211200022110111 is 111011220002112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211200022110111 - 213 = 211200022101919 is a prime.
It is a super-2 number, since 2×2112000221101112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211200022110151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 293505421 + ... + 294224118.
It is an arithmetic number, because the mean of its divisors is an integer number (35200297609680).
Almost surely, 2211200022110111 is an apocalyptic number.
211200022110111 is a deficient number, since it is larger than the sum of its proper divisors (70402358767329).
211200022110111 is a wasteful number, since it uses less digits than its factorization.
211200022110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587849325.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211200022110111 its reverse (111011220002112), we get a palindrome (322211242112223).
The spelling of 211200022110111 in words is "two hundred eleven trillion, two hundred billion, twenty-two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •