Base | Representation |
---|---|
bin | 101111000011111111… |
… | …010011110010000000 |
3 | 11211102201100212212102 |
4 | 233003333103302000 |
5 | 1311442343342342 |
6 | 35114153045532 |
7 | 3436151441330 |
oct | 570377236200 |
9 | 154381325772 |
10 | 50532793472 |
11 | 1a481498737 |
12 | 99633b68a8 |
13 | 49c4267435 |
14 | 26353c10c0 |
15 | 14ab539832 |
hex | bc3fd3c80 |
50532793472 has 96 divisors (see below), whose sum is σ = 118885455360. Its totient is φ = 20957944320.
The previous prime is 50532793469. The next prime is 50532793501. The reversal of 50532793472 is 27439723505.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 831713 + ... + 890399.
It is an arithmetic number, because the mean of its divisors is an integer number (1238390160).
Almost surely, 250532793472 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 50532793472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59442727680).
50532793472 is an abundant number, since it is smaller than the sum of its proper divisors (68352661888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50532793472 is an equidigital number, since it uses as much as digits as its factorization.
50532793472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58770 (or 58727 counting only the distinct ones).
The product of its (nonzero) digits is 1587600, while the sum is 47.
The spelling of 50532793472 in words is "fifty billion, five hundred thirty-two million, seven hundred ninety-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •