Base | Representation |
---|---|
bin | 10111000000101001111101… |
… | …01010111100101011001000 |
3 | 20122011022121021002120120022 |
4 | 23200110332222330223020 |
5 | 23113012411124111021 |
6 | 255341202554320012 |
7 | 13441506454214435 |
oct | 1340247652745310 |
9 | 218138537076508 |
10 | 50600061160136 |
11 | 15139402425154 |
12 | 581276a129008 |
13 | 2230746c454c7 |
14 | c6d0ada4cb8c |
15 | 5cb35505e1ab |
hex | 2e053eabcac8 |
50600061160136 has 16 divisors (see below), whose sum is σ = 95599352193840. Its totient is φ = 25106900575120.
The previous prime is 50600061160127. The next prime is 50600061160153. The reversal of 50600061160136 is 63106116000605.
50600061160136 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×506000611601363 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50600061160096 and 50600061160105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24141249506 + ... + 24141251601.
It is an arithmetic number, because the mean of its divisors is an integer number (5974959512115).
Almost surely, 250600061160136 is an apocalyptic number.
It is an amenable number.
50600061160136 is a deficient number, since it is larger than the sum of its proper divisors (44999291033704).
50600061160136 is a wasteful number, since it uses less digits than its factorization.
50600061160136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48282501244 (or 48282501240 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 35.
The spelling of 50600061160136 in words is "fifty trillion, six hundred billion, sixty-one million, one hundred sixty thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •