Base | Representation |
---|---|
bin | 101111000011011000… |
… | …000101111011100000 |
3 | 11211102000000120212122 |
4 | 233003120011323200 |
5 | 1311432230404440 |
6 | 35113144443412 |
7 | 3435665163422 |
oct | 570330057340 |
9 | 154360016778 |
10 | 50522513120 |
11 | 1a476706982 |
12 | 995ba79568 |
13 | 49c20a80a1 |
14 | 2633ca6812 |
15 | 14aa6a87b5 |
hex | bc3605ee0 |
50522513120 has 96 divisors (see below), whose sum is σ = 123128431776. Its totient is φ = 19580774400.
The previous prime is 50522513117. The next prime is 50522513137. The reversal of 50522513120 is 2131522505.
It is a self number, because there is not a number n which added to its sum of digits gives 50522513120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 615290 + ... + 692550.
It is an arithmetic number, because the mean of its divisors is an integer number (1282587831).
Almost surely, 250522513120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50522513120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61564215888).
50522513120 is an abundant number, since it is smaller than the sum of its proper divisors (72605918656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50522513120 is a wasteful number, since it uses less digits than its factorization.
50522513120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77404 (or 77396 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The spelling of 50522513120 in words is "fifty billion, five hundred twenty-two million, five hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •