Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100011000011001001011011 |
3 | 222020212222120211202022101102 |
4 | 231201131001203003021123 |
5 | 202220224112023210021 |
6 | 1545451355212142015 |
7 | 60112524140440610 |
oct | 5541350143031133 |
9 | 866788524668342 |
10 | 200211000210011 |
11 | 588800101460aa |
12 | 1a556296a6790b |
13 | 8793a7c57a15b |
14 | 376239aa2c507 |
15 | 1822e330e500b |
hex | b617418c325b |
200211000210011 has 16 divisors (see below), whose sum is σ = 229816029803520. Its totient is φ = 170857123174080.
The previous prime is 200211000209959. The next prime is 200211000210031. The reversal of 200211000210011 is 110012000112002.
It is not a de Polignac number, because 200211000210011 - 26 = 200211000209947 is a prime.
It is a super-2 number, since 2×2002110002100112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000209974 and 200211000210001.
It is not an unprimeable number, because it can be changed into a prime (200211000210031) 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, 3655130 + ... + 20341631.
It is an arithmetic number, because the mean of its divisors is an integer number (14363501862720).
Almost surely, 2200211000210011 is an apocalyptic number.
200211000210011 is a deficient number, since it is larger than the sum of its proper divisors (29605029593509).
200211000210011 is a wasteful number, since it uses less digits than its factorization.
200211000210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24001994.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200211000210011 its reverse (110012000112002), we get a palindrome (310223000322013).
The spelling of 200211000210011 in words is "two hundred trillion, two hundred eleven billion, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •