Base | Representation |
---|---|
bin | 101111000101010110… |
… | …000010001101000000 |
3 | 11211111022010220202222 |
4 | 233011112002031000 |
5 | 1312014203344000 |
6 | 35120324230212 |
7 | 3436545616625 |
oct | 570526021500 |
9 | 154438126688 |
10 | 50555528000 |
11 | 1a4933064aa |
12 | 996ab3b368 |
13 | 49c8b97413 |
14 | 263841c34c |
15 | 14ad52aa85 |
hex | bc5582340 |
50555528000 has 56 divisors (see below), whose sum is σ = 125200784904. Its totient is φ = 20222208000.
The previous prime is 50555527993. The next prime is 50555528003. The reversal of 50555528000 is 82555505.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 687278656 + 49868249344 = 26216^2 + 223312^2 .
It is a super-2 number, since 2×505555280002 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50555528003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3151721 + ... + 3167720.
Almost surely, 250555528000 is an apocalyptic number.
50555528000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50555528000 is an abundant number, since it is smaller than the sum of its proper divisors (74645256904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50555528000 is an equidigital number, since it uses as much as digits as its factorization.
50555528000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6319468 (or 6319448 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 35.
The spelling of 50555528000 in words is "fifty billion, five hundred fifty-five million, five hundred twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •