Base | Representation |
---|---|
bin | 1011101001110110001… |
… | …1000001000000101101 |
3 | 201010210002122001011022 |
4 | 2322131203001000231 |
5 | 11240013143311314 |
6 | 231550451303525 |
7 | 20315301231332 |
oct | 2723543010055 |
9 | 633702561138 |
10 | 200211697709 |
11 | 77a00313891 |
12 | 329765aaba5 |
13 | 15b591409aa |
14 | 999426a989 |
15 | 531bd3e78e |
hex | 2e9d8c102d |
200211697709 has 2 divisors, whose sum is σ = 200211697710. Its totient is φ = 200211697708.
The previous prime is 200211697639. The next prime is 200211697727. The reversal of 200211697709 is 907796112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103891471684 + 96320226025 = 322322^2 + 310355^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211697709 - 232 = 195916730413 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 200211697709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200211697739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105848854 + 100105848855.
It is an arithmetic number, because the mean of its divisors is an integer number (100105848855).
Almost surely, 2200211697709 is an apocalyptic number.
It is an amenable number.
200211697709 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211697709 is an equidigital number, since it uses as much as digits as its factorization.
200211697709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95256, while the sum is 44.
The spelling of 200211697709 in words is "two hundred billion, two hundred eleven million, six hundred ninety-seven thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •