Base | Representation |
---|---|
bin | 11101110010011110100011… |
… | …101001100011111110001111 |
3 | 122011212122012210211112212100 |
4 | 131302132203221203332033 |
5 | 114133000322022330333 |
6 | 1142350050521010143 |
7 | 36411212534306433 |
oct | 3562364351437617 |
9 | 564778183745770 |
10 | 131012133011343 |
11 | 38820a2a673121 |
12 | 1283b042323953 |
13 | 581451141687c |
14 | 244d041b689c3 |
15 | 1022dd60a6213 |
hex | 7727a3a63f8f |
131012133011343 has 12 divisors (see below), whose sum is σ = 189241250426488. Its totient is φ = 87340728433680.
The previous prime is 131012133011327. The next prime is 131012133011399. The reversal of 131012133011343 is 343110331210131.
131012133011343 is a `hidden beast` number, since 1 + 3 + 1 + 0 + 1 + 2 + 13 + 301 + 1 + 343 = 666.
It is not a de Polignac number, because 131012133011343 - 24 = 131012133011327 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012133011743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56600188 + ... + 58869393.
Almost surely, 2131012133011343 is an apocalyptic number.
131012133011343 is a deficient number, since it is larger than the sum of its proper divisors (58229117415145).
131012133011343 is a wasteful number, since it uses less digits than its factorization.
131012133011343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115595654 (or 115595651 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 131012133011343 its reverse (343110331210131), we get a palindrome (474122464221474).
The spelling of 131012133011343 in words is "one hundred thirty-one trillion, twelve billion, one hundred thirty-three million, eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •