Base | Representation |
---|---|
bin | 11101110111010010111000… |
… | …111101011101100100110011 |
3 | 122020001021202122111010111002 |
4 | 131313102320331131210303 |
5 | 114203411334434000342 |
6 | 1143202122352312215 |
7 | 36444143004120566 |
oct | 3567227075354463 |
9 | 566037678433432 |
10 | 131343203031347 |
11 | 389393810012aa |
12 | 12893238b4266b |
13 | 58397c31c23a8 |
14 | 246108b48c4dd |
15 | 102b8112a1d32 |
hex | 7774b8f5d933 |
131343203031347 has 2 divisors, whose sum is σ = 131343203031348. Its totient is φ = 131343203031346.
The previous prime is 131343203031259. The next prime is 131343203031449. The reversal of 131343203031347 is 743130302343131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131343203031347 - 228 = 131342934595891 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131343203031347.
It is not a weakly prime, because it can be changed into another prime (131343203031647) 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 as a sum of consecutive naturals, namely, 65671601515673 + 65671601515674.
It is an arithmetic number, because the mean of its divisors is an integer number (65671601515674).
Almost surely, 2131343203031347 is an apocalyptic number.
131343203031347 is a deficient number, since it is larger than the sum of its proper divisors (1).
131343203031347 is an equidigital number, since it uses as much as digits as its factorization.
131343203031347 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 38.
Adding to 131343203031347 its reverse (743130302343131), we get a palindrome (874473505374478).
The spelling of 131343203031347 in words is "one hundred thirty-one trillion, three hundred forty-three billion, two hundred three million, thirty-one thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •