Base | Representation |
---|---|
bin | 1011101100101111110… |
… | …1101010101110111111 |
3 | 201012210100222001122212 |
4 | 2323023331222232333 |
5 | 11243112022430122 |
6 | 232200030331035 |
7 | 20343505343234 |
oct | 2731375525677 |
9 | 635710861585 |
10 | 200990436287 |
11 | 7826a952693 |
12 | 32b53359a7b |
13 | 15c5158b254 |
14 | 9a2985d78b |
15 | 53653b6ce2 |
hex | 2ecbf6abbf |
200990436287 has 2 divisors, whose sum is σ = 200990436288. Its totient is φ = 200990436286.
The previous prime is 200990436239. The next prime is 200990436307. The reversal of 200990436287 is 782634099002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200990436287 - 210 = 200990435263 is a prime.
It is a super-3 number, since 3×2009904362873 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200990436887) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100495218143 + 100495218144.
It is an arithmetic number, because the mean of its divisors is an integer number (100495218144).
Almost surely, 2200990436287 is an apocalyptic number.
200990436287 is a deficient number, since it is larger than the sum of its proper divisors (1).
200990436287 is an equidigital number, since it uses as much as digits as its factorization.
200990436287 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 200990436287 in words is "two hundred billion, nine hundred ninety million, four hundred thirty-six thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •