Base | Representation |
---|---|
bin | 101101100000000000000000… |
… | …010110101101110011011011 |
3 | 222020112102210011200012200020 |
4 | 231200000000112231303123 |
5 | 202212110034241210021 |
6 | 1545333440324041523 |
7 | 60102360104443335 |
oct | 5540000026556333 |
9 | 866472704605606 |
10 | 200111122210011 |
11 | 58841717668451 |
12 | 1a53aa61b332a3 |
13 | 8787523114a7c |
14 | 375b603c88455 |
15 | 18205399587c6 |
hex | b600005adcdb |
200111122210011 has 8 divisors (see below), whose sum is σ = 268605533168400. Its totient is φ = 132512063029152.
The previous prime is 200111122209991. The next prime is 200111122210067. The reversal of 200111122210011 is 110012221111002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200111122210011 - 213 = 200111122201819 is a prime.
It is a super-2 number, since 2×2001111222100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200111122210411) 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, 223837943860 + ... + 223837944753.
It is an arithmetic number, because the mean of its divisors is an integer number (33575691646050).
Almost surely, 2200111122210011 is an apocalyptic number.
200111122210011 is a deficient number, since it is larger than the sum of its proper divisors (68494410958389).
200111122210011 is a wasteful number, since it uses less digits than its factorization.
200111122210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 447675888765.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 200111122210011 its reverse (110012221111002), we get a palindrome (310123343321013).
The spelling of 200111122210011 in words is "two hundred trillion, one hundred eleven billion, one hundred twenty-two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •