Base | Representation |
---|---|
bin | 1000010101111000001… |
… | …1111011111100011111 |
3 | 111200220122211110202201 |
4 | 2011132003323330133 |
5 | 4322000333323124 |
6 | 145500413432331 |
7 | 13232255665111 |
oct | 2053603737437 |
9 | 450818743681 |
10 | 143312011039 |
11 | 5586199204a |
12 | 23936a9b6a7 |
13 | 1068babb342 |
14 | 6d174533b1 |
15 | 3adb898144 |
hex | 215e0fbf1f |
143312011039 has 4 divisors (see below), whose sum is σ = 143840837920. Its totient is φ = 142783184160.
The previous prime is 143312011033. The next prime is 143312011057. The reversal of 143312011039 is 930110213341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 930110213341 = 248071 ⋅3749371.
It is a cyclic number.
It is not a de Polignac number, because 143312011039 - 231 = 141164527391 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143312010998 and 143312011016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143312011033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 264413034 + ... + 264413575.
It is an arithmetic number, because the mean of its divisors is an integer number (35960209480).
Almost surely, 2143312011039 is an apocalyptic number.
143312011039 is a deficient number, since it is larger than the sum of its proper divisors (528826881).
143312011039 is an equidigital number, since it uses as much as digits as its factorization.
143312011039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528826880.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 143312011039 in words is "one hundred forty-three billion, three hundred twelve million, eleven thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •