Base | Representation |
---|---|
bin | 100111001000000100… |
… | …001011001001101000 |
3 | 11000102211120021101010 |
4 | 213020010023021220 |
5 | 1142014334234422 |
6 | 31144422423520 |
7 | 3015035450226 |
oct | 471004131150 |
9 | 130384507333 |
10 | 42011243112 |
11 | 168a9284833 |
12 | 8185591ba0 |
13 | 3c66965247 |
14 | 2067751b16 |
15 | 115d36ab0c |
hex | 9c810b268 |
42011243112 has 64 divisors (see below), whose sum is σ = 107150616000. Its totient is φ = 13722269184.
The previous prime is 42011243063. The next prime is 42011243117. The reversal of 42011243112 is 21134211024.
It is not an unprimeable number, because it can be changed into a prime (42011243117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 395814 + ... + 490602.
It is an arithmetic number, because the mean of its divisors is an integer number (1674228375).
Almost surely, 242011243112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42011243112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53575308000).
42011243112 is an abundant number, since it is smaller than the sum of its proper divisors (65139372888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42011243112 is a wasteful number, since it uses less digits than its factorization.
42011243112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95170 (or 95166 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 42011243112 its reverse (21134211024), we get a palindrome (63145454136).
The spelling of 42011243112 in words is "forty-two billion, eleven million, two hundred forty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •