Base | Representation |
---|---|
bin | 100000100101100011110011… |
… | …110000101110110101011001 |
3 | 200210110010020202021210001110 |
4 | 200211203303300232311121 |
5 | 122241112401420334121 |
6 | 1224451345314010533 |
7 | 42121265324026065 |
oct | 4045436360566531 |
9 | 623403222253043 |
10 | 143318558371161 |
11 | 41736071991148 |
12 | 140a811b276a49 |
13 | 61c7b60b812c4 |
14 | 2756925d80aa5 |
15 | 11880a07e0d76 |
hex | 8258f3c2ed59 |
143318558371161 has 8 divisors (see below), whose sum is σ = 191526699115840. Its totient is φ = 95328061603632.
The previous prime is 143318558371147. The next prime is 143318558371211. The reversal of 143318558371161 is 161173855813341.
143318558371161 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143318558371161 - 27 = 143318558371033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143318558371661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54410992750 + ... + 54410995383.
It is an arithmetic number, because the mean of its divisors is an integer number (23940837389480).
Almost surely, 2143318558371161 is an apocalyptic number.
It is an amenable number.
143318558371161 is a deficient number, since it is larger than the sum of its proper divisors (48208140744679).
143318558371161 is a wasteful number, since it uses less digits than its factorization.
143318558371161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108821988575.
The product of its digits is 7257600, while the sum is 57.
The spelling of 143318558371161 in words is "one hundred forty-three trillion, three hundred eighteen billion, five hundred fifty-eight million, three hundred seventy-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •