Base | Representation |
---|---|
bin | 1100010010000100111… |
… | …1001010010101001111 |
3 | 202011122201110110111002 |
4 | 3010201033022111033 |
5 | 11424122310120421 |
6 | 240534230250515 |
7 | 21150023035313 |
oct | 3044117122517 |
9 | 664581413432 |
10 | 211011020111 |
11 | 81542246621 |
12 | 34a8b1b6a3b |
13 | 16b8a6047a8 |
14 | a2da61db43 |
15 | 574ee8db0b |
hex | 31213ca54f |
211011020111 has 8 divisors (see below), whose sum is σ = 215036125200. Its totient is φ = 207004170240.
The previous prime is 211011020089. The next prime is 211011020113. The reversal of 211011020111 is 111020110112.
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 211011020111 - 26 = 211011020047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211011020092 and 211011020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211011020113) 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, 4540466 + ... + 4586703.
It is an arithmetic number, because the mean of its divisors is an integer number (26879515650).
Almost surely, 2211011020111 is an apocalyptic number.
211011020111 is a deficient number, since it is larger than the sum of its proper divisors (4025105089).
211011020111 is an equidigital number, since it uses as much as digits as its factorization.
211011020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9127609.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 211011020111 its reverse (111020110112), we get a palindrome (322031130223).
Subtracting from 211011020111 its reverse (111020110112), we obtain a palindrome (99990909999).
The spelling of 211011020111 in words is "two hundred eleven billion, eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •