Base | Representation |
---|---|
bin | 101111011100000011… |
… | …110011101101010000 |
3 | 11212110212020200221201 |
4 | 233130003303231100 |
5 | 1313304234013000 |
6 | 35222220400544 |
7 | 3452154114541 |
oct | 573403635520 |
9 | 155425220851 |
10 | 50936626000 |
11 | 1a669441027 |
12 | 9a566a6154 |
13 | 4a59b1b2b0 |
14 | 2672ca24c8 |
15 | 14d1c0896a |
hex | bdc0f3b50 |
50936626000 has 320 divisors, whose sum is σ = 137557195776. Its totient is φ = 18123264000.
The previous prime is 50936625973. The next prime is 50936626001. The reversal of 50936626000 is 62663905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50936626001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 89205715 + ... + 89206285.
Almost surely, 250936626000 is an apocalyptic number.
50936626000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50936626000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68778597888).
50936626000 is an abundant number, since it is smaller than the sum of its proper divisors (86620569776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50936626000 is a wasteful number, since it uses less digits than its factorization.
50936626000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727 (or 711 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 37.
The spelling of 50936626000 in words is "fifty billion, nine hundred thirty-six million, six hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •