Base | Representation |
---|---|
bin | 1000001010011100100… |
… | …1000110011101101001 |
3 | 111101222210012101022202 |
4 | 2002213021012131221 |
5 | 4244204220244223 |
6 | 144232105025545 |
7 | 13063232654462 |
oct | 2024711063551 |
9 | 441883171282 |
10 | 140243134313 |
11 | 54527658597 |
12 | 2321b1852b5 |
13 | 102c006c659 |
14 | 6b05a3bd69 |
15 | 39ac24b428 |
hex | 20a7246769 |
140243134313 has 2 divisors, whose sum is σ = 140243134314. Its totient is φ = 140243134312.
The previous prime is 140243134307. The next prime is 140243134349. The reversal of 140243134313 is 313431342041.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112689790249 + 27553344064 = 335693^2 + 165992^2 .
It is an emirp because it is prime and its reverse (313431342041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140243134313 - 214 = 140243117929 is a prime.
It is not a weakly prime, because it can be changed into another prime (140243134613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70121567156 + 70121567157.
It is an arithmetic number, because the mean of its divisors is an integer number (70121567157).
Almost surely, 2140243134313 is an apocalyptic number.
It is an amenable number.
140243134313 is a deficient number, since it is larger than the sum of its proper divisors (1).
140243134313 is an equidigital number, since it uses as much as digits as its factorization.
140243134313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 140243134313 its reverse (313431342041), we get a palindrome (453674476354).
The spelling of 140243134313 in words is "one hundred forty billion, two hundred forty-three million, one hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •