Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010010010100101100111 |
3 | 222020212222120211101012112202 |
4 | 231201131001202102211213 |
5 | 202220224112000323421 |
6 | 1545451355204005115 |
7 | 60112524135651665 |
oct | 5541350142224547 |
9 | 866788524335482 |
10 | 200211000011111 |
11 | 5888001001a721 |
12 | 1a55629699079b |
13 | 8793a7c50a76b |
14 | 376239a9b9c35 |
15 | 1822e330a610b |
hex | b61741892967 |
200211000011111 has 8 divisors (see below), whose sum is σ = 200376100050000. Its totient is φ = 200045907659520.
The previous prime is 200211000011089. The next prime is 200211000011173. The reversal of 200211000011111 is 111110000112002.
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 200211000011111 - 246 = 129842255833447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000011092 and 200211000011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211000011311) 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, 50783960 + ... + 54584178.
It is an arithmetic number, because the mean of its divisors is an integer number (25047012506250).
Almost surely, 2200211000011111 is an apocalyptic number.
200211000011111 is a deficient number, since it is larger than the sum of its proper divisors (165100038889).
200211000011111 is a wasteful number, since it uses less digits than its factorization.
200211000011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3843649.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200211000011111 its reverse (111110000112002), we get a palindrome (311321000123113).
The spelling of 200211000011111 in words is "two hundred trillion, two hundred eleven billion, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •