Base | Representation |
---|---|
bin | 1110001010000010001101… |
… | …11000010111100100011011 |
3 | 11002020002211201202011011022 |
4 | 13011001012320113210123 |
5 | 13040023004202040011 |
6 | 150113234021553055 |
7 | 6362101660102340 |
oct | 705010670274433 |
9 | 132202751664138 |
10 | 31131112143131 |
11 | 9a126a3244730 |
12 | 35a950257578b |
13 | 144a860b22470 |
14 | 798a7a87c7c7 |
15 | 38ebd1d378db |
hex | 1c5046e1791b |
31131112143131 has 32 divisors (see below), whose sum is σ = 41799413687808. Its totient is φ = 22391474423040.
The previous prime is 31131112143083. The next prime is 31131112143133. The reversal of 31131112143131 is 13134121113113.
It is a cyclic number.
It is not a de Polignac number, because 31131112143131 - 210 = 31131112142107 is a prime.
It is a super-2 number, since 2×311311121431312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31131112143131.
It is not an unprimeable number, because it can be changed into a prime (31131112143133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44282831 + ... + 44980343.
It is an arithmetic number, because the mean of its divisors is an integer number (1306231677744).
Almost surely, 231131112143131 is an apocalyptic number.
31131112143131 is a deficient number, since it is larger than the sum of its proper divisors (10668301544677).
31131112143131 is a wasteful number, since it uses less digits than its factorization.
31131112143131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742131.
The product of its digits is 648, while the sum is 26.
Adding to 31131112143131 its reverse (13134121113113), we get a palindrome (44265233256244).
The spelling of 31131112143131 in words is "thirty-one trillion, one hundred thirty-one billion, one hundred twelve million, one hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •