Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0111101101010000111 |
3 | 201010202222122102202102 |
4 | 2322131130331222013 |
5 | 11240012242023421 |
6 | 231550353302315 |
7 | 20315251602563 |
oct | 2723534755207 |
9 | 633688572672 |
10 | 200210111111 |
11 | 779aa42a84a |
12 | 32975b6499b |
13 | 15b58a0678a |
14 | 9993d766a3 |
15 | 531bb2960b |
hex | 2e9d73da87 |
200210111111 has 8 divisors (see below), whose sum is σ = 217545792000. Its totient is φ = 183554260920.
The previous prime is 200210111083. The next prime is 200210111119. The reversal of 200210111111 is 111111012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210111111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200210111092 and 200210111101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210111119) 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 7 ways as a sum of consecutive naturals, for example, 169957061 + ... + 169958238.
It is an arithmetic number, because the mean of its divisors is an integer number (27193224000).
Almost surely, 2200210111111 is an apocalyptic number.
200210111111 is a deficient number, since it is larger than the sum of its proper divisors (17335680889).
200210111111 is a wasteful number, since it uses less digits than its factorization.
200210111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339915349.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200210111111 its reverse (111111012002), we get a palindrome (311321123113).
The spelling of 200210111111 in words is "two hundred billion, two hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •