Base | Representation |
---|---|
bin | 11110111100100111010010… |
… | …111110000111101101101100 |
3 | 122211220200022222211102000222 |
4 | 132330213102332013231230 |
5 | 120314433120041032303 |
6 | 1201250325334310512 |
7 | 40445250230361524 |
oct | 3674472276075554 |
9 | 584820288742028 |
10 | 136106758142828 |
11 | 3a405608748490 |
12 | 13322499ab8438 |
13 | 5ac3a735a93a5 |
14 | 25878607ac684 |
15 | 10b06b0c0d938 |
hex | 7bc9d2f87b6c |
136106758142828 has 48 divisors (see below), whose sum is σ = 267305687276544. Its totient is φ = 60108421491840.
The previous prime is 136106758142809. The next prime is 136106758142833. The reversal of 136106758142828 is 828241857601631.
It is a super-3 number, since 3×1361067581428283 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 239919776 + ... + 240486407.
It is an arithmetic number, because the mean of its divisors is an integer number (5568868484928).
Almost surely, 2136106758142828 is an apocalyptic number.
It is an amenable number.
136106758142828 is a deficient number, since it is larger than the sum of its proper divisors (131198929133716).
136106758142828 is a wasteful number, since it uses less digits than its factorization.
136106758142828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480406382 (or 480406380 counting only the distinct ones).
The product of its (nonzero) digits is 30965760, while the sum is 62.
The spelling of 136106758142828 in words is "one hundred thirty-six trillion, one hundred six billion, seven hundred fifty-eight million, one hundred forty-two thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •