Base | Representation |
---|---|
bin | 101110001011101010000101… |
… | …010111101101110001110011 |
3 | 222122011020121121111101002102 |
4 | 232023222011113231301303 |
5 | 203110233310144430022 |
6 | 1555552003242011015 |
7 | 60532205616512036 |
oct | 5613520527556163 |
9 | 878136547441072 |
10 | 203111241014387 |
11 | 59798aa24a9662 |
12 | 1a94439b7a6a6b |
13 | 8944400440604 |
14 | 38228ca86901d |
15 | 18735c9818a92 |
hex | b8ba855edc73 |
203111241014387 has 2 divisors, whose sum is σ = 203111241014388. Its totient is φ = 203111241014386.
The previous prime is 203111241014299. The next prime is 203111241014389. The reversal of 203111241014387 is 783410142111302.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 203111241014387 - 224 = 203111224237171 is a prime.
Together with 203111241014389, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 203111241014387.
It is not a weakly prime, because it can be changed into another prime (203111241014389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101555620507193 + 101555620507194.
It is an arithmetic number, because the mean of its divisors is an integer number (101555620507194).
Almost surely, 2203111241014387 is an apocalyptic number.
203111241014387 is a deficient number, since it is larger than the sum of its proper divisors (1).
203111241014387 is an equidigital number, since it uses as much as digits as its factorization.
203111241014387 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 38.
Adding to 203111241014387 its reverse (783410142111302), we get a palindrome (986521383125689).
The spelling of 203111241014387 in words is "two hundred three trillion, one hundred eleven billion, two hundred forty-one million, fourteen thousand, three hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •