Base | Representation |
---|---|
bin | 101110111101011011… |
… | …011101100000000000 |
3 | 11211011001021020000020 |
4 | 232331123131200000 |
5 | 1311231204422200 |
6 | 35055222053440 |
7 | 3433344104616 |
oct | 567533354000 |
9 | 154131236006 |
10 | 50422732800 |
11 | 1a425355500 |
12 | 993257a280 |
13 | 49a751058b |
14 | 26249316b6 |
15 | 14a1a48ea0 |
hex | bbd6dd800 |
50422732800 has 432 divisors, whose sum is σ = 183289284360. Its totient is φ = 12219187200.
The previous prime is 50422732781. The next prime is 50422732849. The reversal of 50422732800 is 823722405.
50422732800 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 18584244 + ... + 18586956.
Almost surely, 250422732800 is an apocalyptic number.
50422732800 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 50422732800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91644642180).
50422732800 is an abundant number, since it is smaller than the sum of its proper divisors (132866551560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50422732800 is a wasteful number, since it uses less digits than its factorization.
50422732800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2770 (or 2734 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
The spelling of 50422732800 in words is "fifty billion, four hundred twenty-two million, seven hundred thirty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •