Base | Representation |
---|---|
bin | 11111110101100101110100… |
… | …101001111111101011010001 |
3 | 200100202222201220002020100011 |
4 | 133311211310221333223101 |
5 | 121323110414102421143 |
6 | 1213445145413354521 |
7 | 41331161205031231 |
oct | 3765456451775321 |
9 | 610688656066304 |
10 | 140022185982673 |
11 | 40685091686415 |
12 | 138552a2938a41 |
13 | 601905cc4c6b7 |
14 | 2681177a41cc1 |
15 | 112c472105e9d |
hex | 7f5974a7fad1 |
140022185982673 has 2 divisors, whose sum is σ = 140022185982674. Its totient is φ = 140022185982672.
The previous prime is 140022185982611. The next prime is 140022185982703. The reversal of 140022185982673 is 376289581220041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131259709800769 + 8762476181904 = 11456863^2 + 2960148^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140022185982673 is a prime.
It is not a weakly prime, because it can be changed into another prime (140022185982073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70011092991336 + 70011092991337.
It is an arithmetic number, because the mean of its divisors is an integer number (70011092991337).
It is a 2-persistent number, because it is pandigital, and so is 2⋅140022185982673 = 280044371965346, but 3⋅140022185982673 = 420066557948019 is not.
Almost surely, 2140022185982673 is an apocalyptic number.
It is an amenable number.
140022185982673 is a deficient number, since it is larger than the sum of its proper divisors (1).
140022185982673 is an equidigital number, since it uses as much as digits as its factorization.
140022185982673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11612160, while the sum is 58.
The spelling of 140022185982673 in words is "one hundred forty trillion, twenty-two billion, one hundred eighty-five million, nine hundred eighty-two thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •