Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0100011000001011001 |
3 | 201010202222102220002121 |
4 | 2322131130203001121 |
5 | 11240012230031014 |
6 | 231550351101241 |
7 | 20315250636523 |
oct | 2723534430131 |
9 | 633688386077 |
10 | 200210002009 |
11 | 779aa365886 |
12 | 32975b11821 |
13 | 15b58998c14 |
14 | 9993d48a13 |
15 | 531bb07124 |
hex | 2e9d723059 |
200210002009 has 2 divisors, whose sum is σ = 200210002010. Its totient is φ = 200210002008.
The previous prime is 200210001961. The next prime is 200210002033. The reversal of 200210002009 is 900200012002.
It is a happy number.
200210002009 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 can be written as a sum of positive squares in only one way, i.e., 194675088400 + 5534913609 = 441220^2 + 74397^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210002009 - 213 = 200209993817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210001983 and 200210002001.
It is not a weakly prime, because it can be changed into another prime (200210002039) 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, 100105001004 + 100105001005.
It is an arithmetic number, because the mean of its divisors is an integer number (100105001005).
Almost surely, 2200210002009 is an apocalyptic number.
It is an amenable number.
200210002009 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210002009 is an equidigital number, since it uses as much as digits as its factorization.
200210002009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The spelling of 200210002009 in words is "two hundred billion, two hundred ten million, two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •