Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100000011111010111001101 |
3 | 222020212220112211201210111021 |
4 | 231201130102200133113031 |
5 | 202220221003004304442 |
6 | 1545451145020554141 |
7 | 60112465445365126 |
oct | 5541342240372715 |
9 | 866786484653437 |
10 | 200210211009997 |
11 | 5887a745711491 |
12 | 1a5560b66b2951 |
13 | 8793984c08cb6 |
14 | 3762323cb504d |
15 | 1822dd8ba2e67 |
hex | b6171281f5cd |
200210211009997 has 2 divisors, whose sum is σ = 200210211009998. Its totient is φ = 200210211009996.
The previous prime is 200210211009911. The next prime is 200210211010067. The reversal of 200210211009997 is 799900112012002.
200210211009997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142899693932356 + 57310517077641 = 11954066^2 + 7570371^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210211009997 - 27 = 200210211009869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210211003997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105105504998 + 100105105504999.
It is an arithmetic number, because the mean of its divisors is an integer number (100105105504999).
Almost surely, 2200210211009997 is an apocalyptic number.
It is an amenable number.
200210211009997 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210211009997 is an equidigital number, since it uses as much as digits as its factorization.
200210211009997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 43.
The spelling of 200210211009997 in words is "two hundred trillion, two hundred ten billion, two hundred eleven million, nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •