Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010101000110101000011 |
3 | 222020212222120211112211111211 |
4 | 231201131001202220311003 |
5 | 202220224112011232321 |
6 | 1545451355205550551 |
7 | 60112524136511410 |
oct | 5541350142506503 |
9 | 866788524484454 |
10 | 200211000102211 |
11 | 5888001008210a |
12 | 1a556296a15457 |
13 | 8793a7c540077 |
14 | 376239aa01107 |
15 | 1822e330c30e1 |
hex | b617418a8d43 |
200211000102211 has 8 divisors (see below), whose sum is σ = 233680924131840. Its totient is φ = 167958164219208.
The previous prime is 200211000102121. The next prime is 200211000102229. The reversal of 200211000102211 is 112201000112002.
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 200211000102211 - 227 = 200210865884483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000102191 and 200211000102200.
It is not an unprimeable number, because it can be changed into a prime (200211000108211) 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, 304272036301 + ... + 304272036958.
It is an arithmetic number, because the mean of its divisors is an integer number (29210115516480).
Almost surely, 2200211000102211 is an apocalyptic number.
200211000102211 is a deficient number, since it is larger than the sum of its proper divisors (33469924029629).
200211000102211 is an equidigital number, since it uses as much as digits as its factorization.
200211000102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608544073313.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200211000102211 its reverse (112201000112002), we get a palindrome (312412000214213).
The spelling of 200211000102211 in words is "two hundred trillion, two hundred eleven billion, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •