Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100011000101110110110111 |
3 | 222020212222120211202212121112 |
4 | 231201131001203011312313 |
5 | 202220224112024033421 |
6 | 1545451355212305235 |
7 | 60112524140515145 |
oct | 5541350143056667 |
9 | 866788524685545 |
10 | 200211000221111 |
11 | 58880010153480 |
12 | 1a556296a7221b |
13 | 8793a7c582219 |
14 | 376239aa32595 |
15 | 1822e330e845b |
hex | b617418c5db7 |
200211000221111 has 8 divisors (see below), whose sum is σ = 229907368675200. Its totient is φ = 172430526506040.
The previous prime is 200211000221077. The next prime is 200211000221119. The reversal of 200211000221111 is 111122000112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-200211000221111 is a prime.
It is a super-4 number, since 4×2002110002211114 (a number of 58 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211000221119) 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, 478973684531 + ... + 478973684948.
It is an arithmetic number, because the mean of its divisors is an integer number (28738421084400).
Almost surely, 2200211000221111 is an apocalyptic number.
200211000221111 is a deficient number, since it is larger than the sum of its proper divisors (29696368454089).
200211000221111 is a wasteful number, since it uses less digits than its factorization.
200211000221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957947369509.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 200211000221111 its reverse (111122000112002), we get a palindrome (311333000333113).
The spelling of 200211000221111 in words is "two hundred trillion, two hundred eleven billion, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •