Base | Representation |
---|---|
bin | 11111111011100101101001… |
… | …001011101010000110110001 |
3 | 200102020101111112202211021220 |
4 | 133323211221023222012301 |
5 | 121401333431421403131 |
6 | 1214402344224535253 |
7 | 41403021061211643 |
oct | 3773455113520661 |
9 | 612211445684256 |
10 | 140434310341041 |
11 | 408239470886a2 |
12 | 1390113a481529 |
13 | 6048b8b414192 |
14 | 26970b2154893 |
15 | 1138043136e96 |
hex | 7fb9692ea1b1 |
140434310341041 has 8 divisors (see below), whose sum is σ = 187245822762240. Its totient is φ = 93622835740272.
The previous prime is 140434310341001. The next prime is 140434310341051. The reversal of 140434310341041 is 140143013434041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140434310341041 - 26 = 140434310340977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140434310340993 and 140434310341011.
It is not an unprimeable number, because it can be changed into a prime (140434310341001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 797056 + ... + 16778078.
It is an arithmetic number, because the mean of its divisors is an integer number (23405727845280).
Almost surely, 2140434310341041 is an apocalyptic number.
It is an amenable number.
140434310341041 is a deficient number, since it is larger than the sum of its proper divisors (46811512421199).
140434310341041 is a wasteful number, since it uses less digits than its factorization.
140434310341041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18910215.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 140434310341041 its reverse (140143013434041), we get a palindrome (280577323775082).
The spelling of 140434310341041 in words is "one hundred forty trillion, four hundred thirty-four billion, three hundred ten million, three hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •