Base | Representation |
---|---|
bin | 100000100011010011001010… |
… | …000101110001000111101011 |
3 | 200202220021100101011100101002 |
4 | 200203103022011301013223 |
5 | 122231041304021413234 |
6 | 1224252141255145215 |
7 | 42104126362153364 |
oct | 4043231205610753 |
9 | 622807311140332 |
10 | 143163240419819 |
11 | 41686209a60494 |
12 | 14081bb367520b |
13 | 61b630a92b699 |
14 | 274d1d0204b6b |
15 | 118400ee0227e |
hex | 8234ca1711eb |
143163240419819 has 2 divisors, whose sum is σ = 143163240419820. Its totient is φ = 143163240419818.
The previous prime is 143163240419809. The next prime is 143163240419917. The reversal of 143163240419819 is 918914042361341.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 143163240419819 - 236 = 143094520943083 is a prime.
It is a super-2 number, since 2×1431632404198192 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (143163240419809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71581620209909 + 71581620209910.
It is an arithmetic number, because the mean of its divisors is an integer number (71581620209910).
Almost surely, 2143163240419819 is an apocalyptic number.
143163240419819 is a deficient number, since it is larger than the sum of its proper divisors (1).
143163240419819 is an equidigital number, since it uses as much as digits as its factorization.
143163240419819 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4478976, while the sum is 56.
The spelling of 143163240419819 in words is "one hundred forty-three trillion, one hundred sixty-three billion, two hundred forty million, four hundred nineteen thousand, eight hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •