Base | Representation |
---|---|
bin | 110000000001101010000011… |
… | …001001100101010011111111 |
3 | 1000200212110000002001100012020 |
4 | 300001222003021211103333 |
5 | 210141112232103310421 |
6 | 2025121101511011223 |
7 | 62330102013645465 |
oct | 6001520311452377 |
9 | 1020773002040166 |
10 | 211220102010111 |
11 | 61334a400a7157 |
12 | 1b833a54969b13 |
13 | 90b1c7c57542c |
14 | 3a23170d18835 |
15 | 19644bd888dc6 |
hex | c01a832654ff |
211220102010111 has 8 divisors (see below), whose sum is σ = 286940515938480. Its totient is φ = 138156544710912.
The previous prime is 211220102010091. The next prime is 211220102010121. The reversal of 211220102010111 is 111010201022112.
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 211220102010111 - 225 = 211220068455679 is a prime.
It is a super-2 number, since 2×2112201020101112 (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 (211220102010121) 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, 664214157106 + ... + 664214157423.
It is an arithmetic number, because the mean of its divisors is an integer number (35867564492310).
Almost surely, 2211220102010111 is an apocalyptic number.
211220102010111 is a deficient number, since it is larger than the sum of its proper divisors (75720413928369).
211220102010111 is a wasteful number, since it uses less digits than its factorization.
211220102010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1328428314585.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211220102010111 its reverse (111010201022112), we get a palindrome (322230303032223).
The spelling of 211220102010111 in words is "two hundred eleven trillion, two hundred twenty billion, one hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •