Base | Representation |
---|---|
bin | 10100011111111000… |
… | …11101100001011010 |
3 | 1001101221201011111102 |
4 | 22033330131201122 |
5 | 140014230113132 |
6 | 5020001431402 |
7 | 536466220325 |
oct | 121774354132 |
9 | 31357634442 |
10 | 11004926042 |
11 | 4737aa2900 |
12 | 217163b562 |
13 | 1064c60876 |
14 | 7657d37bc |
15 | 446213c62 |
hex | 28ff1d85a |
11004926042 has 36 divisors (see below), whose sum is σ = 18494436030. Its totient is φ = 4907554080.
The previous prime is 11004926041. The next prime is 11004926113. The reversal of 11004926042 is 24062940011.
It can be written as a sum of positive squares in 3 ways, for example, as 10671096601 + 333829441 = 103301^2 + 18271^2 .
It is a super-3 number, since 3×110049260423 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11004925996 and 11004926014.
It is not an unprimeable number, because it can be changed into a prime (11004926041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 671684 + ... + 687872.
Almost surely, 211004926042 is an apocalyptic number.
11004926042 is a deficient number, since it is larger than the sum of its proper divisors (7489509988).
11004926042 is a wasteful number, since it uses less digits than its factorization.
11004926042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16319 (or 16255 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 11004926042 in words is "eleven billion, four million, nine hundred twenty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •