Base | Representation |
---|---|
bin | 101110100111010111… |
… | …001001010000011000 |
3 | 11210012020121120120211 |
4 | 232213113021100120 |
5 | 1310001420040202 |
6 | 34554354500504 |
7 | 3421230152263 |
oct | 564727112030 |
9 | 153166546524 |
10 | 50052502552 |
11 | 1a255372a98 |
12 | 984a594734 |
13 | 49488c3220 |
14 | 25cb6b9cda |
15 | 147e2b61d7 |
hex | ba75c9418 |
50052502552 has 64 divisors (see below), whose sum is σ = 107631931680. Its totient is φ = 21616453632.
The previous prime is 50052502547. The next prime is 50052502553. The reversal of 50052502552 is 25520525005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50052502553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224043 + ... + 387685.
Almost surely, 250052502552 is an apocalyptic number.
50052502552 is a gapful number since it is divisible by the number (52) 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 50052502552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53815965840).
50052502552 is an abundant number, since it is smaller than the sum of its proper divisors (57579429128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50052502552 is a wasteful number, since it uses less digits than its factorization.
50052502552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163852 (or 163848 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 31.
The spelling of 50052502552 in words is "fifty billion, fifty-two million, five hundred two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •