Base | Representation |
---|---|
bin | 1000001010011100100… |
… | …0001101101001011101 |
3 | 111101222202202120002122 |
4 | 2002213020031221131 |
5 | 4244204140322342 |
6 | 144232100032325 |
7 | 13063230665141 |
oct | 2024710155135 |
9 | 441882676078 |
10 | 140242901597 |
11 | 54527509767 |
12 | 2321b0926a5 |
13 | 102bccba756 |
14 | 6b059bb221 |
15 | 39ac2024d2 |
hex | 20a720da5d |
140242901597 has 2 divisors, whose sum is σ = 140242901598. Its totient is φ = 140242901596.
The previous prime is 140242901587. The next prime is 140242901611. The reversal of 140242901597 is 795109242041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81552509476 + 58690392121 = 285574^2 + 242261^2 .
It is an emirp because it is prime and its reverse (795109242041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140242901597 - 210 = 140242900573 is a prime.
It is a super-3 number, since 3×1402429015973 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140242901507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70121450798 + 70121450799.
It is an arithmetic number, because the mean of its divisors is an integer number (70121450799).
Almost surely, 2140242901597 is an apocalyptic number.
It is an amenable number.
140242901597 is a deficient number, since it is larger than the sum of its proper divisors (1).
140242901597 is an equidigital number, since it uses as much as digits as its factorization.
140242901597 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 44.
The spelling of 140242901597 in words is "one hundred forty billion, two hundred forty-two million, nine hundred one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •