Base | Representation |
---|---|
bin | 100000100100101000101001… |
… | …010111101000100100101111 |
3 | 200210020001021120120101002121 |
4 | 200210220221113220210233 |
5 | 122234042302003032033 |
6 | 1224402242002133411 |
7 | 42113556161312341 |
oct | 4044505127504457 |
9 | 623201246511077 |
10 | 143255033252143 |
11 | 4171113368aa8a |
12 | 14097950951267 |
13 | 61c1b79001397 |
14 | 275381b271291 |
15 | 11865d386d62d |
hex | 824a295e892f |
143255033252143 has 2 divisors, whose sum is σ = 143255033252144. Its totient is φ = 143255033252142.
The previous prime is 143255033252141. The next prime is 143255033252171. The reversal of 143255033252143 is 341252330552341.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 143255033252143 - 21 = 143255033252141 is a prime.
It is a super-3 number, since 3×1432550332521433 (a number of 43 digits) contains 333 as substring.
Together with 143255033252141, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 143255033252143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143255033252141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71627516626071 + 71627516626072.
It is an arithmetic number, because the mean of its divisors is an integer number (71627516626072).
Almost surely, 2143255033252143 is an apocalyptic number.
143255033252143 is a deficient number, since it is larger than the sum of its proper divisors (1).
143255033252143 is an equidigital number, since it uses as much as digits as its factorization.
143255033252143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 143255033252143 in words is "one hundred forty-three trillion, two hundred fifty-five billion, thirty-three million, two hundred fifty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •