Base | Representation |
---|---|
bin | 10111110101111… |
… | …10110101100101 |
3 | 111221100121122212 |
4 | 23322332311211 |
5 | 402200323414 |
6 | 31502533205 |
7 | 4646031524 |
oct | 1372766545 |
9 | 457317585 |
10 | 200011109 |
11 | a29a0341 |
12 | 56b97205 |
13 | 3258c38c |
14 | 1c7c64bb |
15 | 1285c83e |
hex | bebed65 |
200011109 has 2 divisors, whose sum is σ = 200011110. Its totient is φ = 200011108.
The previous prime is 200011087. The next prime is 200011117. The reversal of 200011109 is 901110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135256900 + 64754209 = 11630^2 + 8047^2 .
It is a cyclic number.
It is not a de Polignac number, because 200011109 - 212 = 200007013 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 200011093 and 200011102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200011129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005554 + 100005555.
It is an arithmetic number, because the mean of its divisors is an integer number (100005555).
Almost surely, 2200011109 is an apocalyptic number.
It is an amenable number.
200011109 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011109 is an equidigital number, since it uses as much as digits as its factorization.
200011109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 200011109 is about 14142.5283807387. The cubic root of 200011109 is about 584.8143750798.
The spelling of 200011109 in words is "two hundred million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •