Base | Representation |
---|---|
bin | 1000010101111010001… |
… | …0111011000111110011 |
3 | 111200221020010011112222 |
4 | 2011132202323013303 |
5 | 4322004423243011 |
6 | 145501303511255 |
7 | 13232415016436 |
oct | 2053642730763 |
9 | 450836104488 |
10 | 143320134131 |
11 | 55866530049 |
12 | 2393975852b |
13 | 106906a37c5 |
14 | 6d1856981d |
15 | 3adc44eddb |
hex | 215e8bb1f3 |
143320134131 has 2 divisors, whose sum is σ = 143320134132. Its totient is φ = 143320134130.
The previous prime is 143320134109. The next prime is 143320134149. The reversal of 143320134131 is 131431023341.
It is a strong prime.
It is an emirp because it is prime and its reverse (131431023341) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143320134131 is a prime.
It is a super-3 number, since 3×1433201341313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 143320134131.
It is not a weakly prime, because it can be changed into another prime (143320134151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71660067065 + 71660067066.
It is an arithmetic number, because the mean of its divisors is an integer number (71660067066).
Almost surely, 2143320134131 is an apocalyptic number.
143320134131 is a deficient number, since it is larger than the sum of its proper divisors (1).
143320134131 is an equidigital number, since it uses as much as digits as its factorization.
143320134131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 143320134131 its reverse (131431023341), we get a palindrome (274751157472).
The spelling of 143320134131 in words is "one hundred forty-three billion, three hundred twenty million, one hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •