Base | Representation |
---|---|
bin | 10111000000101011110011… |
… | …11010010110111010010111 |
3 | 20122011102011112021200201010 |
4 | 23200111321322112322113 |
5 | 23113021430043234021 |
6 | 255341445341103303 |
7 | 13441543213201542 |
oct | 1340257172267227 |
9 | 218142145250633 |
10 | 50601055055511 |
11 | 15139872459494 |
12 | 58129a6b57b33 |
13 | 2230874b25b8c |
14 | c6d165a4b859 |
15 | 5cb3b2436976 |
hex | 2e0579e96e97 |
50601055055511 has 8 divisors (see below), whose sum is σ = 68226141648240. Its totient is φ = 33355002583232.
The previous prime is 50601055055479. The next prime is 50601055055527. The reversal of 50601055055511 is 11555055010605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50601055055511 - 25 = 50601055055479 is a prime.
It is a super-2 number, since 2×506010550555112 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50601055055511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50601055055581) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94758529800 + ... + 94758530333.
It is an arithmetic number, because the mean of its divisors is an integer number (8528267706030).
Almost surely, 250601055055511 is an apocalyptic number.
50601055055511 is a deficient number, since it is larger than the sum of its proper divisors (17625086592729).
50601055055511 is a wasteful number, since it uses less digits than its factorization.
50601055055511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189517060225.
The product of its (nonzero) digits is 93750, while the sum is 39.
The spelling of 50601055055511 in words is "fifty trillion, six hundred one billion, fifty-five million, fifty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •