Base | Representation |
---|---|
bin | 10011000101000000011… |
… | …100010111011011100011 |
3 | 11122100001001201201012202 |
4 | 103011000130113123203 |
5 | 132440010311444412 |
6 | 2442141502043415 |
7 | 163501642566224 |
oct | 23050034273343 |
9 | 4570031651182 |
10 | 1311046203107 |
11 | 466014448073 |
12 | 19210a87956b |
13 | 9682877abb4 |
14 | 4765264524b |
15 | 24183a8e3c2 |
hex | 131407176e3 |
1311046203107 has 2 divisors, whose sum is σ = 1311046203108. Its totient is φ = 1311046203106.
The previous prime is 1311046203017. The next prime is 1311046203109. The reversal of 1311046203107 is 7013026401131.
Together with previous prime (1311046203017) 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 1311046203107 - 222 = 1311042008803 is a prime.
Together with 1311046203109, 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 1311046203107.
It is not a weakly prime, because it can be changed into another prime (1311046203109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655523101553 + 655523101554.
It is an arithmetic number, because the mean of its divisors is an integer number (655523101554).
Almost surely, 21311046203107 is an apocalyptic number.
1311046203107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311046203107 is an equidigital number, since it uses as much as digits as its factorization.
1311046203107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
The spelling of 1311046203107 in words is "one trillion, three hundred eleven billion, forty-six million, two hundred three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •