Base | Representation |
---|---|
bin | 100111001101101010… |
… | …101111000011101101 |
3 | 11000200101102200202200 |
4 | 213031222233003231 |
5 | 1142212420101431 |
6 | 31202021212113 |
7 | 3020256421110 |
oct | 471552570355 |
9 | 130611380680 |
10 | 42105237741 |
11 | 16947344346 |
12 | 81b0b61039 |
13 | 3c80285478 |
14 | 207601c577 |
15 | 1166735ee6 |
hex | 9cdaaf0ed |
42105237741 has 12 divisors (see below), whose sum is σ = 69507059232. Its totient is φ = 24060135816.
The previous prime is 42105237737. The next prime is 42105237749. The reversal of 42105237741 is 14773250124.
42105237741 is a `hidden beast` number, since 4 + 21 + 0 + 523 + 77 + 41 = 666.
It is not a de Polignac number, because 42105237741 - 22 = 42105237737 is a prime.
It is a super-2 number, since 2×421052377412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42105237696 and 42105237705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42105237749) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 334168491 + ... + 334168616.
It is an arithmetic number, because the mean of its divisors is an integer number (5792254936).
Almost surely, 242105237741 is an apocalyptic number.
It is an amenable number.
42105237741 is a deficient number, since it is larger than the sum of its proper divisors (27401821491).
42105237741 is a wasteful number, since it uses less digits than its factorization.
42105237741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668337120 (or 668337117 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
Adding to 42105237741 its reverse (14773250124), we get a palindrome (56878487865).
The spelling of 42105237741 in words is "forty-two billion, one hundred five million, two hundred thirty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •