Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …011111101100010111001101 |
3 | 222020212220112211100011221101 |
4 | 231201130102133230113031 |
5 | 202220221002431113401 |
6 | 1545451145012303101 |
7 | 60112465443535114 |
oct | 5541342237542715 |
9 | 866786484304841 |
10 | 200210210801101 |
11 | 5887a745589546 |
12 | 1a5560b6611a91 |
13 | 8793984b64ba7 |
14 | 3762323c5cc7b |
15 | 1822dd8b61101 |
hex | b617127ec5cd |
200210210801101 has 2 divisors, whose sum is σ = 200210210801102. Its totient is φ = 200210210801100.
The previous prime is 200210210801099. The next prime is 200210210801191. The reversal of 200210210801101 is 101108012012002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128481998300100 + 71728212501001 = 11334990^2 + 8469251^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210210801101 - 21 = 200210210801099 is a prime.
Together with 200210210801099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210210801191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105105400550 + 100105105400551.
It is an arithmetic number, because the mean of its divisors is an integer number (100105105400551).
Almost surely, 2200210210801101 is an apocalyptic number.
It is an amenable number.
200210210801101 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210210801101 is an equidigital number, since it uses as much as digits as its factorization.
200210210801101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 200210210801101 its reverse (101108012012002), we get a palindrome (301318222813103).
The spelling of 200210210801101 in words is "two hundred trillion, two hundred ten billion, two hundred ten million, eight hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •