Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110000110101101010111 |
3 | 222020212222120220021000011211 |
4 | 231201131001212012231113 |
5 | 202220224112224323111 |
6 | 1545451355241242251 |
7 | 60112524150315133 |
oct | 5541350146065527 |
9 | 866788526230154 |
10 | 200211001011031 |
11 | 588800106429aa |
12 | 1a556297193387 |
13 | 8793a7c79a92a |
14 | 376239ab9a3c3 |
15 | 1822e33202521 |
hex | b61741986b57 |
200211001011031 has 2 divisors, whose sum is σ = 200211001011032. Its totient is φ = 200211001011030.
The previous prime is 200211001011019. The next prime is 200211001011037. The reversal of 200211001011031 is 130110100112002.
It is a happy number.
200211001011031 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 is a cyclic number.
It is not a de Polignac number, because 200211001011031 - 29 = 200211001010519 is a prime.
It is a super-2 number, since 2×2002110010110312 (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 (200211001011037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105500505515 + 100105500505516.
It is an arithmetic number, because the mean of its divisors is an integer number (100105500505516).
Almost surely, 2200211001011031 is an apocalyptic number.
200211001011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211001011031 is an equidigital number, since it uses as much as digits as its factorization.
200211001011031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 200211001011031 its reverse (130110100112002), we get a palindrome (330321101123033).
The spelling of 200211001011031 in words is "two hundred trillion, two hundred eleven billion, one million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •