Base | Representation |
---|---|
bin | 101111011111110111… |
… | …101011101000010010 |
3 | 11212122022112200111100 |
4 | 233133313223220102 |
5 | 1313422120243200 |
6 | 35232422525230 |
7 | 3453561400533 |
oct | 573767535022 |
9 | 155568480440 |
10 | 51000556050 |
11 | 1a6a1536684 |
12 | 9a73b96816 |
13 | 4a6a143022 |
14 | 267b58468a |
15 | 14d7635d00 |
hex | bdfdeba12 |
51000556050 has 72 divisors (see below), whose sum is σ = 137236032180. Its totient is φ = 13578854400.
The previous prime is 51000556021. The next prime is 51000556091. The reversal of 51000556050 is 5065500015.
51000556050 is a `hidden beast` number, since 5 + 1 + 0 + 0 + 0 + 55 + 605 + 0 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 35215900281 + 15784655769 = 187659^2 + 125637^2 .
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 35 ways as a sum of consecutive naturals, for example, 200046 + ... + 376854.
Almost surely, 251000556050 is an apocalyptic number.
51000556050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 51000556050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68618016090).
51000556050 is an abundant number, since it is smaller than the sum of its proper divisors (86235476130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51000556050 is a wasteful number, since it uses less digits than its factorization.
51000556050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177468 (or 177460 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 51000556050 in words is "fifty-one billion, five hundred fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •