Base | Representation |
---|---|
bin | 11111110101100110101011… |
… | …110111110010001100010101 |
3 | 200100210002010110012021122120 |
4 | 133311212223313302030111 |
5 | 121323114313230004331 |
6 | 1213445421344450153 |
7 | 41331223154003142 |
oct | 3765465367621425 |
9 | 610702113167576 |
10 | 140023112344341 |
11 | 40685517583676 |
12 | 13855501019959 |
13 | 6019179b45cb5 |
14 | 2681224aa13c9 |
15 | 112c4c85dd796 |
hex | 7f59abdf2315 |
140023112344341 has 16 divisors (see below), whose sum is σ = 187473769895808. Its totient is φ = 92960791347200.
The previous prime is 140023112344301. The next prime is 140023112344441. The reversal of 140023112344341 is 143443211320041.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 140023112344341 - 26 = 140023112344277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140023112344301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21244425 + ... + 27043886.
It is an arithmetic number, because the mean of its divisors is an integer number (11717110618488).
Almost surely, 2140023112344341 is an apocalyptic number.
It is an amenable number.
140023112344341 is a deficient number, since it is larger than the sum of its proper divisors (47450657551467).
140023112344341 is a wasteful number, since it uses less digits than its factorization.
140023112344341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48292332.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 140023112344341 its reverse (143443211320041), we get a palindrome (283466323664382).
The spelling of 140023112344341 in words is "one hundred forty trillion, twenty-three billion, one hundred twelve million, three hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •