Base | Representation |
---|---|
bin | 101110110110001110… |
… | …110001101001110000 |
3 | 11210211122000200102100 |
4 | 232312032301221300 |
5 | 1311004300420320 |
6 | 35035225420400 |
7 | 3430346443620 |
oct | 566616615160 |
9 | 153748020370 |
10 | 50301966960 |
11 | 1a373170323 |
12 | 98ba03a700 |
13 | 49884a8bbb |
14 | 2612896880 |
15 | 1496141790 |
hex | bb63b1a70 |
50301966960 has 480 divisors, whose sum is σ = 196993105920. Its totient is φ = 11266117632.
The previous prime is 50301966937. The next prime is 50301966971. The reversal of 50301966960 is 6966910305.
It is a Cunningham number, because it is equal to 2242812-1.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 56966679 + ... + 56967561.
It is an arithmetic number, because the mean of its divisors is an integer number (410402304).
Almost surely, 250301966960 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50301966960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98496552960).
50301966960 is an abundant number, since it is smaller than the sum of its proper divisors (146691138960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50301966960 is a wasteful number, since it uses less digits than its factorization.
50301966960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125 (or 1116 counting only the distinct ones).
The product of its (nonzero) digits is 262440, while the sum is 45.
The spelling of 50301966960 in words is "fifty billion, three hundred one million, nine hundred sixty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •