Base | Representation |
---|---|
bin | 101110111110011110… |
… | …111100001101100000 |
3 | 11211012021112221100200 |
4 | 232332132330031200 |
5 | 1311300222002430 |
6 | 35101053145200 |
7 | 3433650341415 |
oct | 567636741540 |
9 | 154167487320 |
10 | 50440422240 |
11 | 1a43433787a |
12 | 993848b200 |
13 | 49ab0950c0 |
14 | 262701810c |
15 | 14a3390460 |
hex | bbe7bc360 |
50440422240 has 288 divisors, whose sum is σ = 188869786560. Its totient is φ = 12181598208.
The previous prime is 50440422239. The next prime is 50440422247. The reversal of 50440422240 is 4222404405.
It is a tau number, because it is divible by the number of its divisors (288).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50440422247) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 966741 + ... + 1017579.
It is an arithmetic number, because the mean of its divisors is an integer number (655797870).
Almost surely, 250440422240 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 50440422240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94434893280).
50440422240 is an abundant number, since it is smaller than the sum of its proper divisors (138429364320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50440422240 is a wasteful number, since it uses less digits than its factorization.
50440422240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50926 (or 50915 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 27.
Adding to 50440422240 its reverse (4222404405), we get a palindrome (54662826645).
The spelling of 50440422240 in words is "fifty billion, four hundred forty million, four hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •