Base | Representation |
---|---|
bin | 101101011110011000101101… |
… | …100010011110111110001011 |
3 | 222020010211111120220001210002 |
4 | 231132120231202132332023 |
5 | 202203300413021320021 |
6 | 1545210454550313215 |
7 | 60061352450644661 |
oct | 5536305542367613 |
9 | 866124446801702 |
10 | 200000211120011 |
11 | 587a96822009a5 |
12 | 1a52146a05880b |
13 | 8779c28c3a773 |
14 | 37560c1a9cc31 |
15 | 181c6e789350b |
hex | b5e62d89ef8b |
200000211120011 has 8 divisors (see below), whose sum is σ = 200486146885920. Its totient is φ = 199514625835392.
The previous prime is 200000211119983. The next prime is 200000211120029. The reversal of 200000211120011 is 110021112000002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200000211120011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000211119974 and 200000211120001.
It is not an unprimeable number, because it can be changed into a prime (200000211120041) 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, 86477630 + ... + 88760243.
It is an arithmetic number, because the mean of its divisors is an integer number (25060768360740).
Almost surely, 2200000211120011 is an apocalyptic number.
200000211120011 is a deficient number, since it is larger than the sum of its proper divisors (485935765909).
200000211120011 is a wasteful number, since it uses less digits than its factorization.
200000211120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175240645.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200000211120011 its reverse (110021112000002), we get a palindrome (310021323120013).
The spelling of 200000211120011 in words is "two hundred trillion, two hundred eleven million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •