Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …01001100111000001110000 |
3 | 20120001000012000221011011222 |
4 | 23113212221221213001300 |
5 | 23023202122000100000 |
6 | 254201535043524212 |
7 | 13350264334132514 |
oct | 1327465151470160 |
9 | 216030160834158 |
10 | 50000560550000 |
11 | 14a28133a11655 |
12 | 573653a689668 |
13 | 21b90568b8478 |
14 | c4c07bc42144 |
15 | 5ba968e88a85 |
hex | 2d79a9a67070 |
50000560550000 has 120 divisors (see below), whose sum is σ = 127460378732400. Its totient is φ = 18947580480000.
The previous prime is 50000560549999. The next prime is 50000560550029. The reversal of 50000560550000 is 5506500005.
50000560550000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25366085 + ... + 27266084.
It is an arithmetic number, because the mean of its divisors is an integer number (1062169822770).
Almost surely, 250000560550000 is an apocalyptic number.
50000560550000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50000560550000 is an abundant number, since it is smaller than the sum of its proper divisors (77459818182400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50000560550000 is an equidigital number, since it uses as much as digits as its factorization.
50000560550000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52632221 (or 52632195 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 26.
The spelling of 50000560550000 in words is "fifty trillion, five hundred sixty million, five hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •