Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0110001100101000010 |
3 | 201010210001112012021002 |
4 | 2322131200301211002 |
5 | 11240013021011320 |
6 | 231550430532002 |
7 | 20315263233446 |
oct | 2723540614502 |
9 | 633701465232 |
10 | 200211110210 |
11 | 779aaa52451 |
12 | 32976367002 |
13 | 15b58c96467 |
14 | 9994156826 |
15 | 531bc75675 |
hex | 2e9d831942 |
200211110210 has 128 divisors (see below), whose sum is σ = 405287608320. Its totient is φ = 70847078400.
The previous prime is 200211110191. The next prime is 200211110237. The reversal of 200211110210 is 12011112002.
It is a junction number, because it is equal to n+sod(n) for n = 200211110191 and 200211110200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51638792 + ... + 51642668.
It is an arithmetic number, because the mean of its divisors is an integer number (3166309440).
Almost surely, 2200211110210 is an apocalyptic number.
200211110210 is an abundant number, since it is smaller than the sum of its proper divisors (205076498110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211110210 is a wasteful number, since it uses less digits than its factorization.
200211110210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4212.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200211110210 its reverse (12011112002), we get a palindrome (212222222212).
The spelling of 200211110210 in words is "two hundred billion, two hundred eleven million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •