Base | Representation |
---|---|
bin | 11111111001111110001010… |
… | …100100110011011100010101 |
3 | 200101211202201011202101202022 |
4 | 133321332022210303130111 |
5 | 121343023404031300232 |
6 | 1214235331103222525 |
7 | 41362005513106352 |
oct | 3771761244633425 |
9 | 611752634671668 |
10 | 140323201431317 |
11 | 4079080aa98273 |
12 | 138a36b02a7a45 |
13 | 603b562267098 |
14 | 2691971993629 |
15 | 11351dd9e8812 |
hex | 7f9f8a933715 |
140323201431317 has 2 divisors, whose sum is σ = 140323201431318. Its totient is φ = 140323201431316.
The previous prime is 140323201431289. The next prime is 140323201431337. The reversal of 140323201431317 is 713134102323041.
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., 137334984438001 + 2988216993316 = 11719001^2 + 1728646^2 .
It is a cyclic number.
It is not a de Polignac number, because 140323201431317 - 242 = 135925154920213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140323201431337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70161600715658 + 70161600715659.
It is an arithmetic number, because the mean of its divisors is an integer number (70161600715659).
Almost surely, 2140323201431317 is an apocalyptic number.
It is an amenable number.
140323201431317 is a deficient number, since it is larger than the sum of its proper divisors (1).
140323201431317 is an equidigital number, since it uses as much as digits as its factorization.
140323201431317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36288, while the sum is 35.
Adding to 140323201431317 its reverse (713134102323041), we get a palindrome (853457303754358).
The spelling of 140323201431317 in words is "one hundred forty trillion, three hundred twenty-three billion, two hundred one million, four hundred thirty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •