Base | Representation |
---|---|
bin | 1110001010000010001110… |
… | …11110011001101001100111 |
3 | 11002020002212102111200102102 |
4 | 13011001013132121221213 |
5 | 13040023014230110002 |
6 | 150113235015402315 |
7 | 6362102140615361 |
oct | 705010736315147 |
9 | 132202772450372 |
10 | 31131122113127 |
11 | 9a126a89342a3 |
12 | 35a950598339b |
13 | 144a862c0347a |
14 | 798a7bd15d31 |
15 | 38ebd2b56a02 |
hex | 1c5047799a67 |
31131122113127 has 2 divisors, whose sum is σ = 31131122113128. Its totient is φ = 31131122113126.
The previous prime is 31131122113109. The next prime is 31131122113141. The reversal of 31131122113127 is 72131122113113.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31131122113127 - 216 = 31131122047591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31131122113127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31131122113187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15565561056563 + 15565561056564.
It is an arithmetic number, because the mean of its divisors is an integer number (15565561056564).
Almost surely, 231131122113127 is an apocalyptic number.
31131122113127 is a deficient number, since it is larger than the sum of its proper divisors (1).
31131122113127 is an equidigital number, since it uses as much as digits as its factorization.
31131122113127 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1512, while the sum is 29.
The spelling of 31131122113127 in words is "thirty-one trillion, one hundred thirty-one billion, one hundred twenty-two million, one hundred thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •