Base | Representation |
---|---|
bin | 111000110110110010111100… |
… | …1010111010101110001000000 |
3 | 2102120202021022200021001210110 |
4 | 1301231211321113111301000 |
5 | 1011022320014201401021 |
6 | 4531352232435031320 |
7 | 210224631403354062 |
oct | 16155457127256100 |
9 | 2376667280231713 |
10 | 500112323075136 |
11 | 135395499524692 |
12 | 4811115113b540 |
13 | 1860950b254a65 |
14 | 8b6d7cbd97732 |
15 | 3cc4108924476 |
hex | 1c6d9795d5c40 |
500112323075136 has 28 divisors (see below), whose sum is σ = 1323213854803472. Its totient is φ = 166704107691648.
The previous prime is 500112323075129. The next prime is 500112323075147. The reversal of 500112323075136 is 631570323211005.
It is a super-2 number, since 2×5001123230751362 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 500112323075094 and 500112323075103.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1302375841150 + ... + 1302375841533.
Almost surely, 2500112323075136 is an apocalyptic number.
It is an amenable number.
500112323075136 is an abundant number, since it is smaller than the sum of its proper divisors (823101531728336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500112323075136 is a wasteful number, since it uses less digits than its factorization.
500112323075136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2604751682698 (or 2604751682688 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 39.
The spelling of 500112323075136 in words is "five hundred trillion, one hundred twelve billion, three hundred twenty-three million, seventy-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •