Base | Representation |
---|---|
bin | 11101010101110100… |
… | …001100000000111011 |
3 | 10000022121022012010202 |
4 | 131111310030000323 |
5 | 1004010123441011 |
6 | 22250055032415 |
7 | 2163465650225 |
oct | 352564140073 |
9 | 100277265122 |
10 | 31504515131 |
11 | 123a7528571 |
12 | 613296b70b |
13 | 2c80ca853b |
14 | 174c1a5415 |
15 | c45c6623b |
hex | 755d0c03b |
31504515131 has 2 divisors, whose sum is σ = 31504515132. Its totient is φ = 31504515130.
The previous prime is 31504515079. The next prime is 31504515143. The reversal of 31504515131 is 13151540513.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31504515131 is a prime.
It is a super-2 number, since 2×315045151312 (a number of 22 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 = 31504515094 and 31504515103.
It is not a weakly prime, because it can be changed into another prime (31504515191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15752257565 + 15752257566.
It is an arithmetic number, because the mean of its divisors is an integer number (15752257566).
Almost surely, 231504515131 is an apocalyptic number.
31504515131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31504515131 is an equidigital number, since it uses as much as digits as its factorization.
31504515131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 31504515131 in words is "thirty-one billion, five hundred four million, five hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •