Base | Representation |
---|---|
bin | 100000100100000000100101… |
… | …001011101001111011011101 |
3 | 200210001221020102222220102002 |
4 | 200210000211023221323131 |
5 | 122232341200403031031 |
6 | 1224330405104012045 |
7 | 42110504124103250 |
oct | 4044004513517335 |
9 | 623057212886362 |
10 | 143212013330141 |
11 | 416a4967aa4938 |
12 | 1408b545601025 |
13 | 61baab13b0832 |
14 | 27516d9993097 |
15 | 1185416ba9ccb |
hex | 8240252e9edd |
143212013330141 has 8 divisors (see below), whose sum is σ = 165291376065024. Its totient is φ = 121537776517200.
The previous prime is 143212013330119. The next prime is 143212013330213. The reversal of 143212013330141 is 141033310212341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143212013330141 - 26 = 143212013330077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143212013335141) 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, 101281479725 + ... + 101281481138.
It is an arithmetic number, because the mean of its divisors is an integer number (20661422008128).
Almost surely, 2143212013330141 is an apocalyptic number.
It is an amenable number.
143212013330141 is a deficient number, since it is larger than the sum of its proper divisors (22079362734883).
143212013330141 is a wasteful number, since it uses less digits than its factorization.
143212013330141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202562960971.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 143212013330141 its reverse (141033310212341), we get a palindrome (284245323542482).
The spelling of 143212013330141 in words is "one hundred forty-three trillion, two hundred twelve billion, thirteen million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •