Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110110101010101011011 |
3 | 222020212222120220121201011011 |
4 | 231201131001212311111123 |
5 | 202220224112301431021 |
6 | 1545451355245314351 |
7 | 60112524152042002 |
oct | 5541350146652533 |
9 | 866788526551134 |
10 | 200211001202011 |
11 | 58880010763438 |
12 | 1a5562972659b7 |
13 | 8793a7c836837 |
14 | 376239ac09c39 |
15 | 1822e3323dde1 |
hex | b617419b555b |
200211001202011 has 8 divisors (see below), whose sum is σ = 204478863842304. Its totient is φ = 195943474149480.
The previous prime is 200211001201999. The next prime is 200211001202021. The reversal of 200211001202011 is 110202100112002.
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 200211001202011 - 29 = 200211001201499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211001201982 and 200211001202000.
It is not an unprimeable number, because it can be changed into a prime (200211001202021) 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, 82690845 + ... + 85077598.
It is an arithmetic number, because the mean of its divisors is an integer number (25559857980288).
Almost surely, 2200211001202011 is an apocalyptic number.
200211001202011 is a deficient number, since it is larger than the sum of its proper divisors (4267862640293).
200211001202011 is a wasteful number, since it uses less digits than its factorization.
200211001202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167793881.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200211001202011 its reverse (110202100112002), we get a palindrome (310413101314013).
The spelling of 200211001202011 in words is "two hundred trillion, two hundred eleven billion, one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •