Base | Representation |
---|---|
bin | 11101110111010010111000… |
… | …111101011001011010100111 |
3 | 122020001021202122110021010010 |
4 | 131313102320331121122213 |
5 | 114203411334432424221 |
6 | 1143202122352101303 |
7 | 36444143004020121 |
oct | 3567227075313247 |
9 | 566037678407103 |
10 | 131343203014311 |
11 | 38939380a9a522 |
12 | 12893238b34833 |
13 | 58397c31b7702 |
14 | 246108b486211 |
15 | 102b81129bc76 |
hex | 7774b8f596a7 |
131343203014311 has 32 divisors (see below), whose sum is σ = 175974416587008. Its totient is φ = 87137500386560.
The previous prime is 131343203014279. The next prime is 131343203014313. The reversal of 131343203014311 is 113410302343131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 131343203014311 - 25 = 131343203014279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131343203014313) 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 31 ways as a sum of consecutive naturals, for example, 17417209201 + ... + 17417216741.
It is an arithmetic number, because the mean of its divisors is an integer number (5499200518344).
Almost surely, 2131343203014311 is an apocalyptic number.
131343203014311 is a deficient number, since it is larger than the sum of its proper divisors (44631213572697).
131343203014311 is a wasteful number, since it uses less digits than its factorization.
131343203014311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18431.
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 131343203014311 its reverse (113410302343131), we get a palindrome (244753505357442).
The spelling of 131343203014311 in words is "one hundred thirty-one trillion, three hundred forty-three billion, two hundred three million, fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •