Base | Representation |
---|---|
bin | 101110110100110000… |
… | …111110101100000000 |
3 | 11210202220202110211100 |
4 | 232310300332230000 |
5 | 1310432002110231 |
6 | 35032550414400 |
7 | 3426630445230 |
oct | 566460765400 |
9 | 153686673740 |
10 | 50277378816 |
11 | 1a3602a6945 |
12 | 98b1961400 |
13 | 498337a2c2 |
14 | 260d4d5cc0 |
15 | 1493dd61e6 |
hex | bb4c3eb00 |
50277378816 has 648 divisors, whose sum is σ = 177742446336. Its totient is φ = 13383659520.
The previous prime is 50277378803. The next prime is 50277378829. The reversal of 50277378816 is 61887377205.
It is an interprime number because it is at equal distance from previous prime (50277378803) and next prime (50277378829).
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 605751511 + ... + 605751593.
Almost surely, 250277378816 is an apocalyptic number.
50277378816 is a gapful number since it is divisible by the number (56) 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 50277378816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88871223168).
50277378816 is an abundant number, since it is smaller than the sum of its proper divisors (127465067520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50277378816 is a wasteful number, since it uses less digits than its factorization.
50277378816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 3951360, while the sum is 54.
The spelling of 50277378816 in words is "fifty billion, two hundred seventy-seven million, three hundred seventy-eight thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •