Base | Representation |
---|---|
bin | 11111111010001110000111… |
… | …100101011101011111111101 |
3 | 200101220101220222022211001121 |
4 | 133322032013211131133331 |
5 | 121343313444233003432 |
6 | 1214251242540310541 |
7 | 41363153143202302 |
oct | 3772160745353775 |
9 | 611811828284047 |
10 | 140340331141117 |
11 | 4079800029a828 |
12 | 138a6a90b42451 |
13 | 60400620a3b43 |
14 | 26927189990a9 |
15 | 1135892793197 |
hex | 7fa38795d7fd |
140340331141117 has 2 divisors, whose sum is σ = 140340331141118. Its totient is φ = 140340331141116.
The previous prime is 140340331141057. The next prime is 140340331141147. The reversal of 140340331141117 is 711141133043041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130759659530361 + 9580671610756 = 11435019^2 + 3095266^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140340331141117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140340331141147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70170165570558 + 70170165570559.
It is an arithmetic number, because the mean of its divisors is an integer number (70170165570559).
Almost surely, 2140340331141117 is an apocalyptic number.
It is an amenable number.
140340331141117 is a deficient number, since it is larger than the sum of its proper divisors (1).
140340331141117 is an equidigital number, since it uses as much as digits as its factorization.
140340331141117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12096, while the sum is 34.
Adding to 140340331141117 its reverse (711141133043041), we get a palindrome (851481464184158).
The spelling of 140340331141117 in words is "one hundred forty trillion, three hundred forty billion, three hundred thirty-one million, one hundred forty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •