Base | Representation |
---|---|
bin | 101101011110100010110001… |
… | …001101010111101000011111 |
3 | 222020011212101012002200220111 |
4 | 231132202301031113220133 |
5 | 202203440022042041111 |
6 | 1545215442314230451 |
7 | 60062214166604506 |
oct | 5536426115275037 |
9 | 866155335080814 |
10 | 200011010112031 |
11 | 58803213a28498 |
12 | 1a523582725427 |
13 | 877ac5a317081 |
14 | 3756827da783d |
15 | 181cb2a979a21 |
hex | b5e8b1357a1f |
200011010112031 has 2 divisors, whose sum is σ = 200011010112032. Its totient is φ = 200011010112030.
The previous prime is 200011010112013. The next prime is 200011010112077. The reversal of 200011010112031 is 130211010110002.
It is a happy number.
Together with previous prime (200011010112013) 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 200011010112031 - 227 = 200010875894303 is a prime.
It is a super-2 number, since 2×2000110101120312 (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 (200011010116031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005505056015 + 100005505056016.
It is an arithmetic number, because the mean of its divisors is an integer number (100005505056016).
Almost surely, 2200011010112031 is an apocalyptic number.
200011010112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011010112031 is an equidigital number, since it uses as much as digits as its factorization.
200011010112031 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 200011010112031 its reverse (130211010110002), we get a palindrome (330222020222033).
The spelling of 200011010112031 in words is "two hundred trillion, eleven billion, ten million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •