Base | Representation |
---|---|
bin | 1011101010100100… |
… | …0000000000100001 |
3 | 22002020010000221122 |
4 | 2322221000000201 |
5 | 22403103410423 |
6 | 1234414502025 |
7 | 140411461001 |
oct | 27251000041 |
9 | 8066100848 |
10 | 3131310113 |
11 | 13675a76a8 |
12 | 734804915 |
13 | 3ab96b429 |
14 | 219c28001 |
15 | 134d808c8 |
hex | baa40021 |
3131310113 has 2 divisors, whose sum is σ = 3131310114. Its totient is φ = 3131310112.
The previous prime is 3131310101. The next prime is 3131310131. The reversal of 3131310113 is 3110131313.
Together with next prime (3131310131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2778133264 + 353176849 = 52708^2 + 18793^2 .
It is a cyclic number.
It is not a de Polignac number, because 3131310113 - 214 = 3131293729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3131310091 and 3131310100.
It is not a weakly prime, because it can be changed into another prime (3131310613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1565655056 + 1565655057.
It is an arithmetic number, because the mean of its divisors is an integer number (1565655057).
Almost surely, 23131310113 is an apocalyptic number.
It is an amenable number.
3131310113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3131310113 is an equidigital number, since it uses as much as digits as its factorization.
3131310113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 17.
The square root of 3131310113 is about 55958.1103415760. The cubic root of 3131310113 is about 1462.9922545656.
Adding to 3131310113 its reverse (3110131313), we get a palindrome (6241441426).
The spelling of 3131310113 in words is "three billion, one hundred thirty-one million, three hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •