Base | Representation |
---|---|
bin | 101111011011110010… |
… | …001110111101100000 |
3 | 11212110112120122101120 |
4 | 233123302032331200 |
5 | 1313302044102130 |
6 | 35221533532240 |
7 | 3452100006300 |
oct | 573362167540 |
9 | 155415518346 |
10 | 50932019040 |
11 | 1a666884821 |
12 | 9a55044080 |
13 | 4a58b97396 |
14 | 2672423600 |
15 | 14d15e8910 |
hex | bdbc8ef60 |
50932019040 has 864 divisors, whose sum is σ = 203201187840. Its totient is φ = 10686283776.
The previous prime is 50932019011. The next prime is 50932019041. The reversal of 50932019040 is 4091023905.
It is a junction number, because it is equal to n+sod(n) for n = 50932018992 and 50932019010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50932019041) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 401039457 + ... + 401039583.
It is an arithmetic number, because the mean of its divisors is an integer number (235186560).
Almost surely, 250932019040 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 50932019040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101600593920).
50932019040 is an abundant number, since it is smaller than the sum of its proper divisors (152269168800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50932019040 is a wasteful number, since it uses less digits than its factorization.
50932019040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252 (or 220 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 33.
The spelling of 50932019040 in words is "fifty billion, nine hundred thirty-two million, nineteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •