Base | Representation |
---|---|
bin | 101101100001011100001101… |
… | …001101101101011111000111 |
3 | 222020212220022122121211111022 |
4 | 231201130031031231133013 |
5 | 202220220312240413111 |
6 | 1545451132125301355 |
7 | 60112463316462635 |
oct | 5541341515553707 |
9 | 866786278554438 |
10 | 200210122201031 |
11 | 5887a6aa573a48 |
12 | 1a556090a0485b |
13 | 879396c6b3207 |
14 | 3762316198355 |
15 | 1822dd0eae2db |
hex | b6170d36d7c7 |
200210122201031 has 2 divisors, whose sum is σ = 200210122201032. Its totient is φ = 200210122201030.
The previous prime is 200210122201013. The next prime is 200210122201139. The reversal of 200210122201031 is 130102221012002.
Together with previous prime (200210122201013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200210122201031 - 214 = 200210122184647 is a prime.
It is a super-2 number, since 2×2002101222010312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210122204031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105061100515 + 100105061100516.
It is an arithmetic number, because the mean of its divisors is an integer number (100105061100516).
Almost surely, 2200210122201031 is an apocalyptic number.
200210122201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210122201031 is an equidigital number, since it uses as much as digits as its factorization.
200210122201031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 200210122201031 its reverse (130102221012002), we get a palindrome (330312343213033).
The spelling of 200210122201031 in words is "two hundred trillion, two hundred ten billion, one hundred twenty-two million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •