Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1110011001111101001 |
3 | 201010021010011200102112 |
4 | 2322101211303033221 |
5 | 11234110320214121 |
6 | 231514524012105 |
7 | 20310314210624 |
oct | 2722145631751 |
9 | 633233150375 |
10 | 200011101161 |
11 | 77908063713 |
12 | 3291b391035 |
13 | 15b26708001 |
14 | 9975770dbb |
15 | 530941875b |
hex | 2e919733e9 |
200011101161 has 2 divisors, whose sum is σ = 200011101162. Its totient is φ = 200011101160.
The previous prime is 200011101107. The next prime is 200011101163. The reversal of 200011101161 is 161101110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186154279936 + 13856821225 = 431456^2 + 117715^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200011101161 is a prime.
Together with 200011101163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (200011101163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005550580 + 100005550581.
It is an arithmetic number, because the mean of its divisors is an integer number (100005550581).
Almost surely, 2200011101161 is an apocalyptic number.
It is an amenable number.
200011101161 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011101161 is an equidigital number, since it uses as much as digits as its factorization.
200011101161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 200011101161 its reverse (161101110002), we get a palindrome (361112211163).
The spelling of 200011101161 in words is "two hundred billion, eleven million, one hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •