Base | Representation |
---|---|
bin | 11111111110000001011011… |
… | …110010111001101111110011 |
3 | 200102211101021111222011002202 |
4 | 133332001123302321233303 |
5 | 121412104023401102433 |
6 | 1215011251205133415 |
7 | 41421062313316004 |
oct | 3776013362715763 |
9 | 612741244864082 |
10 | 140601589472243 |
11 | 40888887865869 |
12 | 139296439ba26b |
13 | 605b899758b13 |
14 | 26a12206c51ab |
15 | 113c583b78ee8 |
hex | 7fe05bcb9bf3 |
140601589472243 has 2 divisors, whose sum is σ = 140601589472244. Its totient is φ = 140601589472242.
The previous prime is 140601589472219. The next prime is 140601589472263. The reversal of 140601589472243 is 342274985106041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140601589472243 - 218 = 140601589210099 is a prime.
It is a super-2 number, since 2×1406015894722432 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140601589472263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70300794736121 + 70300794736122.
It is an arithmetic number, because the mean of its divisors is an integer number (70300794736122).
It is a 1-persistent number, because it is pandigital, but 2⋅140601589472243 = 281203178944486 is not.
Almost surely, 2140601589472243 is an apocalyptic number.
140601589472243 is a deficient number, since it is larger than the sum of its proper divisors (1).
140601589472243 is an equidigital number, since it uses as much as digits as its factorization.
140601589472243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 140601589472243 in words is "one hundred forty trillion, six hundred one billion, five hundred eighty-nine million, four hundred seventy-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •