Base | Representation |
---|---|
bin | 1011101001011110001… |
… | …1010100000000010011 |
3 | 201010112002100202210111 |
4 | 2322113203110000103 |
5 | 11234311421042321 |
6 | 231532455342151 |
7 | 20312640250213 |
oct | 2722743240023 |
9 | 633462322714 |
10 | 200111112211 |
11 | 7795956247a |
12 | 32948981957 |
13 | 15b4135384a |
14 | 9984b66243 |
15 | 53130c15e1 |
hex | 2e978d4013 |
200111112211 has 8 divisors (see below), whose sum is σ = 201384094464. Its totient is φ = 198839019720.
The previous prime is 200111112203. The next prime is 200111112263. The reversal of 200111112211 is 112211111002.
It is a happy number.
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 200111112211 - 23 = 200111112203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200111112191 and 200111112200.
It is not an unprimeable number, because it can be changed into a prime (200111112281) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 231736 + ... + 673738.
It is an arithmetic number, because the mean of its divisors is an integer number (25173011808).
Almost surely, 2200111112211 is an apocalyptic number.
200111112211 is a deficient number, since it is larger than the sum of its proper divisors (1272982253).
200111112211 is a wasteful number, since it uses less digits than its factorization.
200111112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444881.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200111112211 its reverse (112211111002), we get a palindrome (312322223213).
The spelling of 200111112211 in words is "two hundred billion, one hundred eleven million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •