Base | Representation |
---|---|
bin | 10011000111100101100110… |
… | …00000011100011001101001 |
3 | 12111212012010020111202011012 |
4 | 21203302303000130121221 |
5 | 21002304302120144431 |
6 | 225225521030513305 |
7 | 11566305333205451 |
oct | 1143626300343151 |
9 | 174765106452135 |
10 | 42042143131241 |
11 | 12439a77841140 |
12 | 4870070805835 |
13 | 1a5c731bc1086 |
14 | a54bca00cd61 |
15 | 4cd92c91822b |
hex | 263cb301c669 |
42042143131241 has 8 divisors (see below), whose sum is σ = 46284928219200. Its totient is φ = 37869486722640.
The previous prime is 42042143131139. The next prime is 42042143131283. The reversal of 42042143131241 is 14213134124024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42042143131241 - 222 = 42042138936937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42042143131198 and 42042143131207.
It is not an unprimeable number, because it can be changed into a prime (42042143131841) 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, 17532168581 + ... + 17532170978.
It is an arithmetic number, because the mean of its divisors is an integer number (5785616027400).
Almost surely, 242042143131241 is an apocalyptic number.
It is an amenable number.
42042143131241 is a deficient number, since it is larger than the sum of its proper divisors (4242785087959).
42042143131241 is a wasteful number, since it uses less digits than its factorization.
42042143131241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35064339679.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 42042143131241 its reverse (14213134124024), we get a palindrome (56255277255265).
The spelling of 42042143131241 in words is "forty-two trillion, forty-two billion, one hundred forty-three million, one hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •