Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1011011000010001111 |
3 | 201010021002222122101212 |
4 | 2322101211123002033 |
5 | 11234110304030444 |
6 | 231514521525035 |
7 | 20310313315544 |
oct | 2722145330217 |
9 | 633232878355 |
10 | 200011001999 |
11 | 77907aa6166 |
12 | 3291b34377b |
13 | 15b266a1b33 |
14 | 9975746bcb |
15 | 53093e919e |
hex | 2e9195b08f |
200011001999 has 2 divisors, whose sum is σ = 200011002000. Its totient is φ = 200011001998.
The previous prime is 200011001899. The next prime is 200011002013. The reversal of 200011001999 is 999100110002.
200011001999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200011001999 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200011001899) 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, 100005500999 + 100005501000.
It is an arithmetic number, because the mean of its divisors is an integer number (100005501000).
Almost surely, 2200011001999 is an apocalyptic number.
200011001999 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011001999 is an equidigital number, since it uses as much as digits as its factorization.
200011001999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 200011001999 in words is "two hundred billion, eleven million, one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •