Base | Representation |
---|---|
bin | 111101000001000010… |
… | …0110001111110000101 |
3 | 110112012210112020021101 |
4 | 1322002010301332011 |
5 | 4121323003411323 |
6 | 140110035420101 |
7 | 12316035521446 |
oct | 1720204617605 |
9 | 415183466241 |
10 | 131031310213 |
11 | 5062a838821 |
12 | 2148a154631 |
13 | c48275516b |
14 | 64b04472cd |
15 | 361d67bdad |
hex | 1e82131f85 |
131031310213 has 2 divisors, whose sum is σ = 131031310214. Its totient is φ = 131031310212.
The previous prime is 131031310169. The next prime is 131031310309. The reversal of 131031310213 is 312013130131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100728160129 + 30303150084 = 317377^2 + 174078^2 .
It is a cyclic number.
It is not a de Polignac number, because 131031310213 - 233 = 122441375621 is a prime.
It is a super-2 number, since 2×1310313102132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131031310013) 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, 65515655106 + 65515655107.
It is an arithmetic number, because the mean of its divisors is an integer number (65515655107).
Almost surely, 2131031310213 is an apocalyptic number.
It is an amenable number.
131031310213 is a deficient number, since it is larger than the sum of its proper divisors (1).
131031310213 is an equidigital number, since it uses as much as digits as its factorization.
131031310213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 131031310213 its reverse (312013130131), we get a palindrome (443044440344).
The spelling of 131031310213 in words is "one hundred thirty-one billion, thirty-one million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •