Base | Representation |
---|---|
bin | 100000000010110000110100… |
… | …000010011011000111101101 |
3 | 200110222112002121222211212022 |
4 | 200002300310002123013231 |
5 | 121432423143012420312 |
6 | 1215421043132515525 |
7 | 41453443600662065 |
oct | 4002606402330755 |
9 | 613875077884768 |
10 | 140927339966957 |
11 | 409a3a49496955 |
12 | 139807b501bba5 |
13 | 608351142c93b |
14 | 26b2cc37303a5 |
15 | 1145c9bd54172 |
hex | 802c3409b1ed |
140927339966957 has 2 divisors, whose sum is σ = 140927339966958. Its totient is φ = 140927339966956.
The previous prime is 140927339966929. The next prime is 140927339967017. The reversal of 140927339966957 is 759669933729041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113360440291396 + 27566899675561 = 10647086^2 + 5250419^2 .
It is a cyclic number.
It is not a de Polignac number, because 140927339966957 - 230 = 140926266225133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140927339966927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70463669983478 + 70463669983479.
It is an arithmetic number, because the mean of its divisors is an integer number (70463669983479).
Almost surely, 2140927339966957 is an apocalyptic number.
It is an amenable number.
140927339966957 is a deficient number, since it is larger than the sum of its proper divisors (1).
140927339966957 is an equidigital number, since it uses as much as digits as its factorization.
140927339966957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4166497440, while the sum is 80.
The spelling of 140927339966957 in words is "one hundred forty trillion, nine hundred twenty-seven billion, three hundred thirty-nine million, nine hundred sixty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •