Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110100001010100001011 |
3 | 222020212222120220110112200010 |
4 | 231201131001212201110023 |
5 | 202220224112241320021 |
6 | 1545451355243443003 |
7 | 60112524151250640 |
oct | 5541350146412413 |
9 | 866788526415603 |
10 | 200211001120011 |
11 | 58880010707872 |
12 | 1a556297226463 |
13 | 8793a7c80840b |
14 | 376239abc7dc7 |
15 | 1822e33224976 |
hex | b617419a150b |
200211001120011 has 16 divisors (see below), whose sum is σ = 305084510809344. Its totient is φ = 114405881155104.
The previous prime is 200211001120007. The next prime is 200211001120049. The reversal of 200211001120011 is 110021100112002.
It is not a de Polignac number, because 200211001120011 - 22 = 200211001120007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200211001120061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10761240 + ... + 22720613.
It is an arithmetic number, because the mean of its divisors is an integer number (19067781925584).
Almost surely, 2200211001120011 is an apocalyptic number.
200211001120011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200211001120011 is a deficient number, since it is larger than the sum of its proper divisors (104873509689333).
200211001120011 is a wasteful number, since it uses less digits than its factorization.
200211001120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33766610.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200211001120011 its reverse (110021100112002), we get a palindrome (310232101232013).
It can be divided in two parts, 20021100112001 and 1, that added together give a palindrome (20021100112002).
The spelling of 200211001120011 in words is "two hundred trillion, two hundred eleven billion, one million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •