Base | Representation |
---|---|
bin | 1110000110111001001111… |
… | …00010011010100100000011 |
3 | 11001211210022222210122200212 |
4 | 13003130213202122210003 |
5 | 13031241014300042011 |
6 | 145551511125504335 |
7 | 6351232055006441 |
oct | 703344742324403 |
9 | 131753288718625 |
10 | 31023212112131 |
11 | 9980963511398 |
12 | 359060ab720ab |
13 | 1440626702285 |
14 | 793762537b91 |
15 | 38beb929d08b |
hex | 1c372789a903 |
31023212112131 has 2 divisors, whose sum is σ = 31023212112132. Its totient is φ = 31023212112130.
The previous prime is 31023212112107. The next prime is 31023212112223. The reversal of 31023212112131 is 13121121232013.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 31023212112131 - 226 = 31023145003267 is a prime.
It is a super-2 number, since 2×310232121121312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 31023212112097 and 31023212112106.
It is not a weakly prime, because it can be changed into another prime (31023212112631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15511606056065 + 15511606056066.
It is an arithmetic number, because the mean of its divisors is an integer number (15511606056066).
Almost surely, 231023212112131 is an apocalyptic number.
31023212112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31023212112131 is an equidigital number, since it uses as much as digits as its factorization.
31023212112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 31023212112131 its reverse (13121121232013), we get a palindrome (44144333344144).
The spelling of 31023212112131 in words is "thirty-one trillion, twenty-three billion, two hundred twelve million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •