Base | Representation |
---|---|
bin | 1110001010010100110101… |
… | …10110110100110000011011 |
3 | 11002021001122120021122010211 |
4 | 13011022122312310300123 |
5 | 13040203443401143011 |
6 | 150122010123151551 |
7 | 6362604521453365 |
oct | 705123266646033 |
9 | 132231576248124 |
10 | 31141110959131 |
11 | 9a16964320128 |
12 | 35ab4330755b7 |
13 | 144b7954b6a34 |
14 | 7993487b3d35 |
15 | 3900b9a5eb21 |
hex | 1c529adb4c1b |
31141110959131 has 2 divisors, whose sum is σ = 31141110959132. Its totient is φ = 31141110959130.
The previous prime is 31141110959093. The next prime is 31141110959143. The reversal of 31141110959131 is 13195901114113.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31141110959131 - 241 = 28942087703579 is a prime.
It is a super-2 number, since 2×311411109591312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31141110059131) 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, 15570555479565 + 15570555479566.
It is an arithmetic number, because the mean of its divisors is an integer number (15570555479566).
Almost surely, 231141110959131 is an apocalyptic number.
31141110959131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31141110959131 is an equidigital number, since it uses as much as digits as its factorization.
31141110959131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 40.
The spelling of 31141110959131 in words is "thirty-one trillion, one hundred forty-one billion, one hundred ten million, nine hundred fifty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •