Base | Representation |
---|---|
bin | 11101110010011110101001… |
… | …000001101110100100110111 |
3 | 122011212122110002121020202200 |
4 | 131302132221001232210313 |
5 | 114133001013121413221 |
6 | 1142350103502435543 |
7 | 36411215011212351 |
oct | 3562365101564467 |
9 | 564778402536680 |
10 | 131012223232311 |
11 | 38820a76595503 |
12 | 1283b068592bb3 |
13 | 5814527015265 |
14 | 244d04db320d1 |
15 | 1022ddde78426 |
hex | 7727a906e937 |
131012223232311 has 6 divisors (see below), whose sum is σ = 189239878002240. Its totient is φ = 87341482154868.
The previous prime is 131012223232271. The next prime is 131012223232339. The reversal of 131012223232311 is 113232322210131.
131012223232311 is a `hidden beast` number, since 1 + 3 + 1 + 0 + 1 + 2 + 22 + 323 + 2 + 311 = 666.
It is not a de Polignac number, because 131012223232311 - 225 = 131012189677879 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012223234311) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7278456846231 + ... + 7278456846248.
It is an arithmetic number, because the mean of its divisors is an integer number (31539979667040).
Almost surely, 2131012223232311 is an apocalyptic number.
131012223232311 is a deficient number, since it is larger than the sum of its proper divisors (58227654769929).
131012223232311 is a wasteful number, since it uses less digits than its factorization.
131012223232311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14556913692485 (or 14556913692482 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 131012223232311 its reverse (113232322210131), we get a palindrome (244244545442442).
The spelling of 131012223232311 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-three million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •