Base | Representation |
---|---|
bin | 101101100001011101001000… |
… | …101110110000000010010101 |
3 | 222020212222220020111202020021 |
4 | 231201131020232300002111 |
5 | 202220224333400433343 |
6 | 1545451415155105141 |
7 | 60112530132646021 |
oct | 5541351056600225 |
9 | 866788806452207 |
10 | 200211120717973 |
11 | 58880072174562 |
12 | 1a55630b2a21b1 |
13 | 8793a9b521341 |
14 | 37623aca3b381 |
15 | 1822e3d99b0ed |
hex | b61748bb0095 |
200211120717973 has 2 divisors, whose sum is σ = 200211120717974. Its totient is φ = 200211120717972.
The previous prime is 200211120717913. The next prime is 200211120717983. The reversal of 200211120717973 is 379717021112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193711364228529 + 6499756489444 = 13918023^2 + 2549462^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211120717973 - 217 = 200211120586901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200211120717913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105560358986 + 100105560358987.
It is an arithmetic number, because the mean of its divisors is an integer number (100105560358987).
Almost surely, 2200211120717973 is an apocalyptic number.
It is an amenable number.
200211120717973 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211120717973 is an equidigital number, since it uses as much as digits as its factorization.
200211120717973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 74088, while the sum is 43.
Adding to 200211120717973 its reverse (379717021112002), we get a palindrome (579928141829975).
The spelling of 200211120717973 in words is "two hundred trillion, two hundred eleven billion, one hundred twenty million, seven hundred seventeen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •