Base | Representation |
---|---|
bin | 1011101010010000000… |
… | …0111101010100101001 |
3 | 201011001122211001100002 |
4 | 2322210000331110221 |
5 | 11240223433211332 |
6 | 232005325152345 |
7 | 20321056456331 |
oct | 2724400752451 |
9 | 634048731302 |
10 | 200320210217 |
11 | 77a56599946 |
12 | 329a69bb6b5 |
13 | 15b75774c8a |
14 | 99a48360c1 |
15 | 5326626562 |
hex | 2ea403d529 |
200320210217 has 2 divisors, whose sum is σ = 200320210218. Its totient is φ = 200320210216.
The previous prime is 200320210201. The next prime is 200320210271. The reversal of 200320210217 is 712012023002.
Together with next prime (200320210271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178374454336 + 21945755881 = 422344^2 + 148141^2 .
It is a cyclic number.
It is not a de Polignac number, because 200320210217 - 24 = 200320210201 is a prime.
It is not a weakly prime, because it can be changed into another prime (200320212217) 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, 100160105108 + 100160105109.
It is an arithmetic number, because the mean of its divisors is an integer number (100160105109).
Almost surely, 2200320210217 is an apocalyptic number.
It is an amenable number.
200320210217 is a deficient number, since it is larger than the sum of its proper divisors (1).
200320210217 is an equidigital number, since it uses as much as digits as its factorization.
200320210217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 20.
Adding to 200320210217 its reverse (712012023002), we get a palindrome (912332233219).
The spelling of 200320210217 in words is "two hundred billion, three hundred twenty million, two hundred ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •