Base | Representation |
---|---|
bin | 1110001001001101111000… |
… | …00010110001010101110001 |
3 | 11002010102022110022110220212 |
4 | 13010212330002301111301 |
5 | 13034042432314031304 |
6 | 150052305452313505 |
7 | 6360055441441406 |
oct | 704467402612561 |
9 | 132112273273825 |
10 | 31103013033329 |
11 | 9a01794004636 |
12 | 35a3b80172895 |
13 | 1448003513183 |
14 | 797572a902ad |
15 | 38e0da04566e |
hex | 1c49bc0b1571 |
31103013033329 has 2 divisors, whose sum is σ = 31103013033330. Its totient is φ = 31103013033328.
The previous prime is 31103013033283. The next prime is 31103013033331. The reversal of 31103013033329 is 92333031030113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30200817007729 + 902196025600 = 5495527^2 + 949840^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31103013033329 is a prime.
Together with 31103013033331, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 31103013033295 and 31103013033304.
It is not a weakly prime, because it can be changed into another prime (31103013033349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15551506516664 + 15551506516665.
It is an arithmetic number, because the mean of its divisors is an integer number (15551506516665).
Almost surely, 231103013033329 is an apocalyptic number.
It is an amenable number.
31103013033329 is a deficient number, since it is larger than the sum of its proper divisors (1).
31103013033329 is an equidigital number, since it uses as much as digits as its factorization.
31103013033329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 32.
The spelling of 31103013033329 in words is "thirty-one trillion, one hundred three billion, thirteen million, thirty-three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •