Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …000100101001010011101001 |
3 | 222020212220120111120022202012 |
4 | 231201130103010221103221 |
5 | 202220221012421103123 |
6 | 1545451150000045305 |
7 | 60112465622061416 |
oct | 5541342304512351 |
9 | 866786514508665 |
10 | 200210220487913 |
11 | 5887a74aaa5379 |
12 | 1a5560b9903835 |
13 | 8793986b7702c |
14 | 376232526110d |
15 | 1822dd9926378 |
hex | b617131294e9 |
200210220487913 has 2 divisors, whose sum is σ = 200210220487914. Its totient is φ = 200210220487912.
The previous prime is 200210220487883. The next prime is 200210220487951. The reversal of 200210220487913 is 319784022012002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 175540452692224 + 24669767795689 = 13249168^2 + 4966867^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210220487913 - 220 = 200210219439337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (200210220487213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105110243956 + 100105110243957.
It is an arithmetic number, because the mean of its divisors is an integer number (100105110243957).
Almost surely, 2200210220487913 is an apocalyptic number.
It is an amenable number.
200210220487913 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210220487913 is an equidigital number, since it uses as much as digits as its factorization.
200210220487913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96768, while the sum is 41.
Adding to 200210220487913 its reverse (319784022012002), we get a palindrome (519994242499915).
The spelling of 200210220487913 in words is "two hundred trillion, two hundred ten billion, two hundred twenty million, four hundred eighty-seven thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •