Base | Representation |
---|---|
bin | 11111111101001000000001… |
… | …000101010011010000100101 |
3 | 200102121111010220220012201121 |
4 | 133331020001011103100211 |
5 | 121410101243113322113 |
6 | 1214523053424453541 |
7 | 41413450451552533 |
oct | 3775100105232045 |
9 | 612544126805647 |
10 | 140539938026533 |
11 | 40864720169141 |
12 | 139196b8a7a2b1 |
13 | 6055b22b22726 |
14 | 269c252789153 |
15 | 113ab76463e8d |
hex | 7fd201153425 |
140539938026533 has 2 divisors, whose sum is σ = 140539938026534. Its totient is φ = 140539938026532.
The previous prime is 140539938026387. The next prime is 140539938026539. The reversal of 140539938026533 is 335620839935041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84675644551969 + 55864293474564 = 9201937^2 + 7474242^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140539938026533 is a prime.
It is a super-2 number, since 2×1405399380265332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140539938026539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70269969013266 + 70269969013267.
It is an arithmetic number, because the mean of its divisors is an integer number (70269969013267).
Almost surely, 2140539938026533 is an apocalyptic number.
It is an amenable number.
140539938026533 is a deficient number, since it is larger than the sum of its proper divisors (1).
140539938026533 is an equidigital number, since it uses as much as digits as its factorization.
140539938026533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62985600, while the sum is 61.
The spelling of 140539938026533 in words is "one hundred forty trillion, five hundred thirty-nine billion, nine hundred thirty-eight million, twenty-six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •