Base | Representation |
---|---|
bin | 11101110111010010101101… |
… | …000010110010100001111111 |
3 | 122020001021020201021122000221 |
4 | 131313102231002302201333 |
5 | 114203410432243220221 |
6 | 1143202050451202211 |
7 | 36444135025544311 |
oct | 3567225502624177 |
9 | 566037221248027 |
10 | 131343003101311 |
11 | 38939289166971 |
12 | 128931a1ba6367 |
13 | 5839790960bb1 |
14 | 246106cac77b1 |
15 | 102b7ed95d541 |
hex | 7774ad0b287f |
131343003101311 has 16 divisors (see below), whose sum is σ = 135996959498400. Its totient is φ = 126697390848000.
The previous prime is 131343003101293. The next prime is 131343003101329. The reversal of 131343003101311 is 113101300343131.
It is an interprime number because it is at equal distance from previous prime (131343003101293) and next prime (131343003101329).
It is a de Polignac number, because none of the positive numbers 2k-131343003101311 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 (131343003101341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 418174135 + ... + 418488103.
It is an arithmetic number, because the mean of its divisors is an integer number (8499809968650).
Almost surely, 2131343003101311 is an apocalyptic number.
131343003101311 is a deficient number, since it is larger than the sum of its proper divisors (4653956397089).
131343003101311 is a wasteful number, since it uses less digits than its factorization.
131343003101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327210.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 131343003101311 its reverse (113101300343131), we get a palindrome (244444303444442).
The spelling of 131343003101311 in words is "one hundred thirty-one trillion, three hundred forty-three billion, three million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.286 sec. • engine limits •