Base | Representation |
---|---|
bin | 100000101010100100111000… |
… | …000010110001100001100101 |
3 | 200211200002002110222212201122 |
4 | 200222210320002301201211 |
5 | 122312234420120211031 |
6 | 1225314002020103325 |
7 | 42155221350621530 |
oct | 4052447002614145 |
9 | 624602073885648 |
10 | 143663301335141 |
11 | 4185929a344525 |
12 | 14142ab0b34b45 |
13 | 6221511586c13 |
14 | 27694ab563a17 |
15 | 119202b06947b |
hex | 82a9380b1865 |
143663301335141 has 8 divisors (see below), whose sum is σ = 164198946356544. Its totient is φ = 123130735378560.
The previous prime is 143663301335131. The next prime is 143663301335173. The reversal of 143663301335141 is 141533103366341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143663301335141 - 210 = 143663301334117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143663301335092 and 143663301335101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143663301335131) 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, 769666220 + ... + 769852853.
It is an arithmetic number, because the mean of its divisors is an integer number (20524868294568).
Almost surely, 2143663301335141 is an apocalyptic number.
It is an amenable number.
143663301335141 is a deficient number, since it is larger than the sum of its proper divisors (20535645021403).
143663301335141 is a wasteful number, since it uses less digits than its factorization.
143663301335141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1539532411.
The product of its (nonzero) digits is 699840, while the sum is 44.
The spelling of 143663301335141 in words is "one hundred forty-three trillion, six hundred sixty-three billion, three hundred one million, three hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •