Base | Representation |
---|---|
bin | 111101000000011110… |
… | …0010011010000001111 |
3 | 110112011110202220220221 |
4 | 1322000330103100033 |
5 | 4121303122410111 |
6 | 140104120252211 |
7 | 12315415155361 |
oct | 1720074232017 |
9 | 415143686827 |
10 | 131012310031 |
11 | 50620040699 |
12 | 21483911067 |
13 | c47b831b55 |
14 | 64abadcd31 |
15 | 361bb77371 |
hex | 1e80f1340f |
131012310031 has 2 divisors, whose sum is σ = 131012310032. Its totient is φ = 131012310030.
The previous prime is 131012310029. The next prime is 131012310049. The reversal of 131012310031 is 130013210131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131012310031 - 21 = 131012310029 is a prime.
It is a super-2 number, since 2×1310123100312 (a number of 23 digits) contains 22 as substring.
Together with 131012310029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 131012309987 and 131012310014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131012313031) 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, 65506155015 + 65506155016.
It is an arithmetic number, because the mean of its divisors is an integer number (65506155016).
Almost surely, 2131012310031 is an apocalyptic number.
131012310031 is a deficient number, since it is larger than the sum of its proper divisors (1).
131012310031 is an equidigital number, since it uses as much as digits as its factorization.
131012310031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 131012310031 its reverse (130013210131), we get a palindrome (261025520162).
The spelling of 131012310031 in words is "one hundred thirty-one billion, twelve million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •