Base | Representation |
---|---|
bin | 101111111110011101010001… |
… | …001010101111001111001011 |
3 | 1000200002102110010110222202211 |
4 | 233332131101022233033023 |
5 | 210124011422322320021 |
6 | 2024432055111005551 |
7 | 62305156103504350 |
oct | 5776352112571713 |
9 | 1020072403428684 |
10 | 211000220120011 |
11 | 6125a766547723 |
12 | 1b7b930a9698b7 |
13 | 909730a19315a |
14 | 3a166724d8627 |
15 | 195d8eec293e1 |
hex | bfe7512af3cb |
211000220120011 has 4 divisors (see below), whose sum is σ = 241143108708592. Its totient is φ = 180857331531432.
The previous prime is 211000220119993. The next prime is 211000220120083. The reversal of 211000220120011 is 110021022000112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211000220120011 - 211 = 211000220117963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211000220119973 and 211000220120000.
It is not an unprimeable number, because it can be changed into a prime (211000220120611) 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, 15071444294280 + ... + 15071444294293.
It is an arithmetic number, because the mean of its divisors is an integer number (60285777177148).
Almost surely, 2211000220120011 is an apocalyptic number.
211000220120011 is a deficient number, since it is larger than the sum of its proper divisors (30142888588581).
211000220120011 is an equidigital number, since it uses as much as digits as its factorization.
211000220120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30142888588580.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211000220120011 its reverse (110021022000112), we get a palindrome (321021242120123).
The spelling of 211000220120011 in words is "two hundred eleven trillion, two hundred twenty million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •