Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100011000011001100100011 |
3 | 222020212222120211202022122211 |
4 | 231201131001203003030203 |
5 | 202220224112023211321 |
6 | 1545451355212142551 |
7 | 60112524140441314 |
oct | 5541350143031443 |
9 | 866788524668584 |
10 | 200211000210211 |
11 | 58880010146271 |
12 | 1a556296a67a57 |
13 | 8793a7c57a283 |
14 | 376239aa2c60b |
15 | 1822e330e50e1 |
hex | b617418c3323 |
200211000210211 has 4 divisors (see below), whose sum is σ = 200213737612624. Its totient is φ = 200208262807800.
The previous prime is 200211000210121. The next prime is 200211000210269. The reversal of 200211000210211 is 112012000112002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200211000210211 - 29 = 200211000209699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000210191 and 200211000210200.
It is not an unprimeable number, because it can be changed into a prime (200211000210271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1368591495 + ... + 1368737776.
It is an arithmetic number, because the mean of its divisors is an integer number (50053434403156).
Almost surely, 2200211000210211 is an apocalyptic number.
200211000210211 is a deficient number, since it is larger than the sum of its proper divisors (2737402413).
200211000210211 is an equidigital number, since it uses as much as digits as its factorization.
200211000210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2737402412.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200211000210211 its reverse (112012000112002), we get a palindrome (312223000322213).
The spelling of 200211000210211 in words is "two hundred trillion, two hundred eleven billion, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •