Base | Representation |
---|---|
bin | 101111111110100111010101… |
… | …000001000001011000101011 |
3 | 1000200010110022221022102122011 |
4 | 233332213111001001120223 |
5 | 210124201033124200021 |
6 | 2024441043022540351 |
7 | 62306020560020410 |
oct | 5776472501013053 |
9 | 1020113287272564 |
10 | 211011022100011 |
11 | 612642a9a25121 |
12 | 1b7bb4244376b7 |
13 | 909833c0777b3 |
14 | 3a16db8d80107 |
15 | 195dd33200de1 |
hex | bfe9d504162b |
211011022100011 has 4 divisors (see below), whose sum is σ = 241155453828592. Its totient is φ = 180866590371432.
The previous prime is 211011022100009. The next prime is 211011022100023. The reversal of 211011022100011 is 110001220110112.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 211011022100011 - 21 = 211011022100009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211011022099964 and 211011022100000.
It is not an unprimeable number, because it can be changed into a prime (211011022100041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15072215864280 + ... + 15072215864293.
It is an arithmetic number, because the mean of its divisors is an integer number (60288863457148).
Almost surely, 2211011022100011 is an apocalyptic number.
211011022100011 is a deficient number, since it is larger than the sum of its proper divisors (30144431728581).
211011022100011 is an equidigital number, since it uses as much as digits as its factorization.
211011022100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30144431728580.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211011022100011 its reverse (110001220110112), we get a palindrome (321012242210123).
The spelling of 211011022100011 in words is "two hundred eleven trillion, eleven billion, twenty-two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •