Base | Representation |
---|---|
bin | 101101011110011000100111… |
… | …100101010110111010010011 |
3 | 222020010211020121220010012011 |
4 | 231132120213211112322103 |
5 | 202203300211432211011 |
6 | 1545210441021043351 |
7 | 60061350125506351 |
oct | 5536304745267223 |
9 | 866124217803164 |
10 | 200000111210131 |
11 | 587a9630871151 |
12 | 1a5214406b6557 |
13 | 8779c11328cab |
14 | 37560b26d27d1 |
15 | 181c6ddc0a621 |
hex | b5e627956e93 |
200000111210131 has 2 divisors, whose sum is σ = 200000111210132. Its totient is φ = 200000111210130.
The previous prime is 200000111210113. The next prime is 200000111210147. The reversal of 200000111210131 is 131012111000002.
It is a happy number.
Together with previous prime (200000111210113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200000111210131 - 223 = 200000102821523 is a prime.
It is a super-2 number, since 2×2000001112101312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200000111210531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100000055605065 + 100000055605066.
It is an arithmetic number, because the mean of its divisors is an integer number (100000055605066).
Almost surely, 2200000111210131 is an apocalyptic number.
200000111210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
200000111210131 is an equidigital number, since it uses as much as digits as its factorization.
200000111210131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 200000111210131 its reverse (131012111000002), we get a palindrome (331012222210133).
The spelling of 200000111210131 in words is "two hundred trillion, one hundred eleven million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •