Base | Representation |
---|---|
bin | 101111000010000110… |
… | …001110000011000000 |
3 | 11211100111122011210000 |
4 | 233002012032003000 |
5 | 1311411232104220 |
6 | 35111100440000 |
7 | 3435314563362 |
oct | 570206160300 |
9 | 154314564700 |
10 | 50501050560 |
11 | 1a465587824 |
12 | 9954849000 |
13 | 49ba80204c |
14 | 26310bad32 |
15 | 14a8869390 |
hex | bc218e0c0 |
50501050560 has 140 divisors (see below), whose sum is σ = 179641213488. Its totient is φ = 13466939904.
The previous prime is 50501050553. The next prime is 50501050571. The reversal of 50501050560 is 6505010505.
50501050560 is a `hidden beast` number, since 5 + 0 + 50 + 1 + 0 + 50 + 560 = 666.
It is a super-2 number, since 2×505010505602 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 948252 + ... + 1000091.
Almost surely, 250501050560 is an apocalyptic number.
It is an amenable number.
50501050560 is an abundant number, since it is smaller than the sum of its proper divisors (129140162928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50501050560 is a wasteful number, since it uses less digits than its factorization.
50501050560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948372 (or 1948353 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 50501050560 in words is "fifty billion, five hundred one million, fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •