Base | Representation |
---|---|
bin | 10111000000101001111101… |
… | …01010111100101011001001 |
3 | 20122011022121021002120120100 |
4 | 23200110332222330223021 |
5 | 23113012411124111022 |
6 | 255341202554320013 |
7 | 13441506454214436 |
oct | 1340247652745311 |
9 | 218138537076510 |
10 | 50600061160137 |
11 | 15139402425155 |
12 | 581276a129009 |
13 | 2230746c454c8 |
14 | c6d0ada4cb8d |
15 | 5cb35505e1ac |
hex | 2e053eabcac9 |
50600061160137 has 12 divisors (see below), whose sum is σ = 73132148533444. Its totient is φ = 33713448890400.
The previous prime is 50600061160127. The next prime is 50600061160153. The reversal of 50600061160137 is 73106116000605.
50600061160137 is a `hidden beast` number, since 5 + 0 + 6 + 0 + 0 + 0 + 6 + 11 + 601 + 37 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 35332372362816 + 15267688797321 = 5944104^2 + 3907389^2 .
It is not a de Polignac number, because 50600061160137 - 210 = 50600061159113 is a prime.
It is a super-4 number, since 4×506000611601374 (a number of 56 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50600061160127) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1660418614 + ... + 1660449087.
Almost surely, 250600061160137 is an apocalyptic number.
It is an amenable number.
50600061160137 is a deficient number, since it is larger than the sum of its proper divisors (22532087373307).
50600061160137 is a wasteful number, since it uses less digits than its factorization.
50600061160137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3320869400 (or 3320869397 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 50600061160137 in words is "fifty trillion, six hundred billion, sixty-one million, one hundred sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •