Base | Representation |
---|---|
bin | 10100001101101000011… |
… | …111011010000001101111 |
3 | 11220210022201022001100021 |
4 | 110031220133122001233 |
5 | 140224212020001033 |
6 | 2542035503543011 |
7 | 202232252641363 |
oct | 24155037320157 |
9 | 4823281261307 |
10 | 1389027500143 |
11 | 4960a08a2798 |
12 | 1a52525baa67 |
13 | a0ca55ba6ca |
14 | 4b32d2572a3 |
15 | 261e9c03b2d |
hex | 143687da06f |
1389027500143 has 2 divisors, whose sum is σ = 1389027500144. Its totient is φ = 1389027500142.
The previous prime is 1389027500129. The next prime is 1389027500249. The reversal of 1389027500143 is 3410057209831.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1389027500143 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1389027500143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1389027500123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 694513750071 + 694513750072.
It is an arithmetic number, because the mean of its divisors is an integer number (694513750072).
Almost surely, 21389027500143 is an apocalyptic number.
1389027500143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1389027500143 is an equidigital number, since it uses as much as digits as its factorization.
1389027500143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 43.
The spelling of 1389027500143 in words is "one trillion, three hundred eighty-nine billion, twenty-seven million, five hundred thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •