Base | Representation |
---|---|
bin | 1011101010100100… |
… | …1011011110001111 |
3 | 22002020012102100211 |
4 | 2322221023132033 |
5 | 22403111411241 |
6 | 1234415503251 |
7 | 140412044623 |
oct | 27251133617 |
9 | 8066172324 |
10 | 3131357071 |
11 | 1367629a07 |
12 | 734827b27 |
13 | 3ab98690b |
14 | 219c3b183 |
15 | 134d8e781 |
hex | baa4b78f |
3131357071 has 2 divisors, whose sum is σ = 3131357072. Its totient is φ = 3131357070.
The previous prime is 3131357069. The next prime is 3131357087. The reversal of 3131357071 is 1707531313.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3131357071 - 21 = 3131357069 is a prime.
It is a super-2 number, since 2×31313570712 = 19610794212203398082, which contains 22 as substring.
Together with 3131357069, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3131357371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1565678535 + 1565678536.
It is an arithmetic number, because the mean of its divisors is an integer number (1565678536).
Almost surely, 23131357071 is an apocalyptic number.
3131357071 is a deficient number, since it is larger than the sum of its proper divisors (1).
3131357071 is an equidigital number, since it uses as much as digits as its factorization.
3131357071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6615, while the sum is 31.
The square root of 3131357071 is about 55958.5299217197. The cubic root of 3131357071 is about 1462.9995676757. Note that the first 3 decimals are identical.
Adding to 3131357071 its reverse (1707531313), we get a palindrome (4838888384).
The spelling of 3131357071 in words is "three billion, one hundred thirty-one million, three hundred fifty-seven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •