Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010001111111000001011 |
3 | 222020212222120211100122022122 |
4 | 231201131001202033320023 |
5 | 202220224112000000021 |
6 | 1545451355203441455 |
7 | 60112524135604430 |
oct | 5541350142177013 |
9 | 866788524318278 |
10 | 200211000000011 |
11 | 58880010012350 |
12 | 1a55629698628b |
13 | 8793a7c5056b0 |
14 | 376239a9b5b87 |
15 | 1822e330a2bab |
hex | b6174188fe0b |
200211000000011 has 32 divisors (see below), whose sum is σ = 280502367925248. Its totient is φ = 137746698503040.
The previous prime is 200211000000001. The next prime is 200211000000019. The reversal of 200211000000011 is 110000000112002.
It is not a de Polignac number, because 200211000000011 - 230 = 200209926258187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200211000000019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4348041956 + ... + 4348088001.
It is an arithmetic number, because the mean of its divisors is an integer number (8765698997664).
Almost surely, 2200211000000011 is an apocalyptic number.
200211000000011 is a deficient number, since it is larger than the sum of its proper divisors (80291367925237).
200211000000011 is a wasteful number, since it uses less digits than its factorization.
200211000000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8696130011.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 200211000000011 its reverse (110000000112002), we get a palindrome (310211000112013).
It can be divided in two parts, 2002 and 11000000011, that multiplied together give a palindrome (22022000022022).
The spelling of 200211000000011 in words is "two hundred trillion, two hundred eleven billion, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •