Base | Representation |
---|---|
bin | 101111011011010110… |
… | …111010110110011100 |
3 | 11212110001002212100202 |
4 | 233123112322312130 |
5 | 1313243230440110 |
6 | 35221120243032 |
7 | 3451652105015 |
oct | 573326726634 |
9 | 155401085322 |
10 | 50924858780 |
11 | 1a662834154 |
12 | 9a52770478 |
13 | 4a5755b243 |
14 | 26714bc00c |
15 | 14d0b820a5 |
hex | bdb5bad9c |
50924858780 has 96 divisors (see below), whose sum is σ = 112133210112. Its totient is φ = 19404403200.
The previous prime is 50924858717. The next prime is 50924858783. The reversal of 50924858780 is 8785842905.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50924858783) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10312472 + ... + 10317408.
It is an arithmetic number, because the mean of its divisors is an integer number (1168054272).
Almost surely, 250924858780 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 50924858780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56066605056).
50924858780 is an abundant number, since it is smaller than the sum of its proper divisors (61208351332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50924858780 is a wasteful number, since it uses less digits than its factorization.
50924858780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5235 (or 5233 counting only the distinct ones).
The product of its (nonzero) digits is 6451200, while the sum is 56.
The spelling of 50924858780 in words is "fifty billion, nine hundred twenty-four million, eight hundred fifty-eight thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •