Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …1010011010111000111 |
3 | 201010202222210221200212 |
4 | 2322131131103113013 |
5 | 11240012302400012 |
6 | 231550355230035 |
7 | 20315252423006 |
oct | 2723535232707 |
9 | 633688727625 |
10 | 200210200007 |
11 | 779aa490614 |
12 | 32975ba831b |
13 | 15b58a3808c |
14 | 9993d9ac3d |
15 | 531bb45b22 |
hex | 2e9d7535c7 |
200210200007 has 2 divisors, whose sum is σ = 200210200008. Its totient is φ = 200210200006.
The previous prime is 200210199961. The next prime is 200210200027. The reversal of 200210200007 is 700002012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210200007 - 214 = 200210183623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210199964 and 200210200000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210200027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105100003 + 100105100004.
It is an arithmetic number, because the mean of its divisors is an integer number (100105100004).
Almost surely, 2200210200007 is an apocalyptic number.
200210200007 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210200007 is an equidigital number, since it uses as much as digits as its factorization.
200210200007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 14.
Adding to 200210200007 its reverse (700002012002), we get a palindrome (900212212009).
The spelling of 200210200007 in words is "two hundred billion, two hundred ten million, two hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •