Base | Representation |
---|---|
bin | 11101001010111111… |
… | …111000001001110011 |
3 | 2222211221210210112002 |
4 | 131022333320021303 |
5 | 1003122143431011 |
6 | 22220053124215 |
7 | 2156133235361 |
oct | 351277701163 |
9 | 88757723462 |
10 | 31323030131 |
11 | 12314041168 |
12 | 60a202966b |
13 | 2c52504773 |
14 | 1732042631 |
15 | c34d67c3b |
hex | 74aff8273 |
31323030131 has 2 divisors, whose sum is σ = 31323030132. Its totient is φ = 31323030130.
The previous prime is 31323030113. The next prime is 31323030143. The reversal of 31323030131 is 13103032313.
Together with previous prime (31323030113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31323030131 - 210 = 31323029107 is a prime.
It is a super-2 number, since 2×313230301312 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31323030331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15661515065 + 15661515066.
It is an arithmetic number, because the mean of its divisors is an integer number (15661515066).
Almost surely, 231323030131 is an apocalyptic number.
31323030131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31323030131 is an equidigital number, since it uses as much as digits as its factorization.
31323030131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 31323030131 its reverse (13103032313), we get a palindrome (44426062444).
The spelling of 31323030131 in words is "thirty-one billion, three hundred twenty-three million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •