Base | Representation |
---|---|
bin | 1110000110110011011111… |
… | …11010000011111011001001 |
3 | 11001211111101021201100020011 |
4 | 13003121233322003323021 |
5 | 13031213212103144423 |
6 | 145550241313231521 |
7 | 6351062525401111 |
oct | 703315772037311 |
9 | 131744337640204 |
10 | 31020131303113 |
11 | 997a622477a37 |
12 | 358baab2625a1 |
13 | 1440255366364 |
14 | 79354d2d8041 |
15 | 38bd88a95b0d |
hex | 1c366fe83ec9 |
31020131303113 has 2 divisors, whose sum is σ = 31020131303114. Its totient is φ = 31020131303112.
The previous prime is 31020131303017. The next prime is 31020131303131. The reversal of 31020131303113 is 31130313102013.
Together with next prime (31020131303131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28340323014969 + 2679808288144 = 5323563^2 + 1637012^2 .
It is a cyclic number.
It is not a de Polignac number, because 31020131303113 - 241 = 28821108047561 is a prime.
It is not a weakly prime, because it can be changed into another prime (31020131306113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15510065651556 + 15510065651557.
It is an arithmetic number, because the mean of its divisors is an integer number (15510065651557).
Almost surely, 231020131303113 is an apocalyptic number.
It is an amenable number.
31020131303113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31020131303113 is an equidigital number, since it uses as much as digits as its factorization.
31020131303113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 31020131303113 its reverse (31130313102013), we get a palindrome (62150444405126).
The spelling of 31020131303113 in words is "thirty-one trillion, twenty billion, one hundred thirty-one million, three hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •