Base | Representation |
---|---|
bin | 10110111101101111101110… |
… | …00010110101110110000000 |
3 | 20121210202112001220100200122 |
4 | 23132313313002311312000 |
5 | 23104343123223410011 |
6 | 255223225252435412 |
7 | 13431336640551041 |
oct | 1336676702656600 |
9 | 217722461810618 |
10 | 50500075216256 |
11 | 150aaa63a1a686 |
12 | 57b7305018b68 |
13 | 22241a13178c3 |
14 | c6830680a8c8 |
15 | 5c895219e3db |
hex | 2dedf70b5d80 |
50500075216256 has 128 divisors (see below), whose sum is σ = 103892608955520. Its totient is φ = 24435194368000.
The previous prime is 50500075216249. The next prime is 50500075216289. The reversal of 50500075216256 is 65261257000505.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1657518335 + ... + 1657548801.
It is an arithmetic number, because the mean of its divisors is an integer number (811661007465).
Almost surely, 250500075216256 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 50500075216256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51946304477760).
50500075216256 is an abundant number, since it is smaller than the sum of its proper divisors (53392533739264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50500075216256 is a wasteful number, since it uses less digits than its factorization.
50500075216256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33064 (or 33052 counting only the distinct ones).
The product of its (nonzero) digits is 630000, while the sum is 44.
The spelling of 50500075216256 in words is "fifty trillion, five hundred billion, seventy-five million, two hundred sixteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •