Base | Representation |
---|---|
bin | 101101100011000100011… |
… | …001001000001110011101 |
3 | 102002020011020202020020121 |
4 | 231203010121020032131 |
5 | 402240300431104432 |
6 | 10353525541314541 |
7 | 442065042324166 |
oct | 55430431101635 |
9 | 12066136666217 |
10 | 3130031113117 |
11 | aa7490a66627 |
12 | 426755105a51 |
13 | 199211ca925c |
14 | ab6cc58076d |
15 | 566451a1197 |
hex | 2d8c464839d |
3130031113117 has 2 divisors, whose sum is σ = 3130031113118. Its totient is φ = 3130031113116.
The previous prime is 3130031113087. The next prime is 3130031113129. The reversal of 3130031113117 is 7113111300313.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1838548876761 + 1291482236356 = 1355931^2 + 1136434^2 .
It is a cyclic number.
It is not a de Polignac number, because 3130031113117 - 231 = 3127883629469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3130031113091 and 3130031113100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3130031110117) 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, 1565015556558 + 1565015556559.
It is an arithmetic number, because the mean of its divisors is an integer number (1565015556559).
Almost surely, 23130031113117 is an apocalyptic number.
It is an amenable number.
3130031113117 is a deficient number, since it is larger than the sum of its proper divisors (1).
3130031113117 is an equidigital number, since it uses as much as digits as its factorization.
3130031113117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 25.
The spelling of 3130031113117 in words is "three trillion, one hundred thirty billion, thirty-one million, one hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •