Base | Representation |
---|---|
bin | 11101000101101101… |
… | …100011010100100011 |
3 | 2222121202220212201021 |
4 | 131011231203110203 |
5 | 1002431442341011 |
6 | 22203204150311 |
7 | 2154005340061 |
oct | 350555432443 |
9 | 88552825637 |
10 | 31234340131 |
11 | 12278a75045 |
12 | 6078398397 |
13 | 2c3a020b87 |
14 | 1724357031 |
15 | c2c199471 |
hex | 745b63523 |
31234340131 has 2 divisors, whose sum is σ = 31234340132. Its totient is φ = 31234340130.
The previous prime is 31234340113. The next prime is 31234340149. The reversal of 31234340131 is 13104343213.
Together with previous prime (31234340113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (31234340113) and next prime (31234340149).
It is a cyclic number.
It is not a de Polignac number, because 31234340131 - 225 = 31200785699 is a prime.
It is a super-2 number, since 2×312343401312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31234340096 and 31234340105.
It is not a weakly prime, because it can be changed into another prime (31234340531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15617170065 + 15617170066.
It is an arithmetic number, because the mean of its divisors is an integer number (15617170066).
Almost surely, 231234340131 is an apocalyptic number.
31234340131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31234340131 is an equidigital number, since it uses as much as digits as its factorization.
31234340131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 31234340131 its reverse (13104343213), we get a palindrome (44338683344).
The spelling of 31234340131 in words is "thirty-one billion, two hundred thirty-four million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •