Base | Representation |
---|---|
bin | 1111100111100… |
… | …11010011111111 |
3 | 100010112111200202 |
4 | 13303303103333 |
5 | 232020120111 |
6 | 21000114115 |
7 | 3150436412 |
oct | 763632377 |
9 | 303474622 |
10 | 131020031 |
11 | 67a5931a |
12 | 37a6593b |
13 | 211b4b5c |
14 | 13587b79 |
15 | b780b3b |
hex | 7cf34ff |
131020031 has 2 divisors, whose sum is σ = 131020032. Its totient is φ = 131020030.
The previous prime is 131020013. The next prime is 131020049. The reversal of 131020031 is 130020131.
Together with previous prime (131020013) 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 (131020013) and next prime (131020049).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131020031 is a prime.
It is a super-2 number, since 2×1310200312 = 34332497046481922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 131019994 and 131020021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131020531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65510015 + 65510016.
It is an arithmetic number, because the mean of its divisors is an integer number (65510016).
Almost surely, 2131020031 is an apocalyptic number.
131020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
131020031 is an equidigital number, since it uses as much as digits as its factorization.
131020031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 131020031 is about 11446.3981671092. The cubic root of 131020031 is about 507.9011926270.
Adding to 131020031 its reverse (130020131), we get a palindrome (261040162).
The spelling of 131020031 in words is "one hundred thirty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •