Base | Representation |
---|---|
bin | 11111110110110011000011… |
… | …100100100111101010100101 |
3 | 200101001220210022102220021012 |
4 | 133312303003210213222211 |
5 | 121330440233233233133 |
6 | 1213551222340232005 |
7 | 41340155225401466 |
oct | 3766630344475245 |
9 | 611056708386235 |
10 | 140105114352293 |
11 | 40707277578982 |
12 | 1386938739b605 |
13 | 6023b179790ac |
14 | 26851a3698d6d |
15 | 112e6c7719b48 |
hex | 7f6cc3927aa5 |
140105114352293 has 2 divisors, whose sum is σ = 140105114352294. Its totient is φ = 140105114352292.
The previous prime is 140105114352227. The next prime is 140105114352367. The reversal of 140105114352293 is 392253411501041.
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., 132687890874529 + 7417223477764 = 11519023^2 + 2723458^2 .
It is a cyclic number.
It is not a de Polignac number, because 140105114352293 - 216 = 140105114286757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140105114352293.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140105114252293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70052557176146 + 70052557176147.
It is an arithmetic number, because the mean of its divisors is an integer number (70052557176147).
Almost surely, 2140105114352293 is an apocalyptic number.
It is an amenable number.
140105114352293 is a deficient number, since it is larger than the sum of its proper divisors (1).
140105114352293 is an equidigital number, since it uses as much as digits as its factorization.
140105114352293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 140105114352293 in words is "one hundred forty trillion, one hundred five billion, one hundred fourteen million, three hundred fifty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •