Base | Representation |
---|---|
bin | 1110010010110001000000… |
… | …10011010011110111001011 |
3 | 11010021210012021112122122112 |
4 | 13021120200103103313023 |
5 | 13104431404311331011 |
6 | 150503130453012535 |
7 | 6422552162000651 |
oct | 711304023236713 |
9 | 133253167478575 |
10 | 31431112605131 |
11 | a018950727048 |
12 | 363768802414b |
13 | 146cc30a83435 |
14 | 7a93b9aa0dd1 |
15 | 3978de58858b |
hex | 1c96204d3dcb |
31431112605131 has 2 divisors, whose sum is σ = 31431112605132. Its totient is φ = 31431112605130.
The previous prime is 31431112605071. The next prime is 31431112605163. The reversal of 31431112605131 is 13150621113413.
It is an a-pointer prime, because the next prime (31431112605163) can be obtained adding 31431112605131 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31431112605131 - 214 = 31431112588747 is a prime.
It is a super-2 number, since 2×314311126051312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31431112605181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15715556302565 + 15715556302566.
It is an arithmetic number, because the mean of its divisors is an integer number (15715556302566).
Almost surely, 231431112605131 is an apocalyptic number.
31431112605131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31431112605131 is an equidigital number, since it uses as much as digits as its factorization.
31431112605131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 31431112605131 its reverse (13150621113413), we get a palindrome (44581733718544).
The spelling of 31431112605131 in words is "thirty-one trillion, four hundred thirty-one billion, one hundred twelve million, six hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •