Base | Representation |
---|---|
bin | 1100001011011… |
… | …0101101000000 |
3 | 10120010010120212 |
4 | 3002312231000 |
5 | 101034030000 |
6 | 5022453252 |
7 | 1160113166 |
oct | 302665500 |
9 | 116103525 |
10 | 51080000 |
11 | 26919184 |
12 | 15134228 |
13 | a775b6a |
14 | 6ad9236 |
15 | 473ec35 |
hex | 30b6b40 |
51080000 has 70 divisors (see below), whose sum is σ = 126760986. Its totient is φ = 20416000.
The previous prime is 51079967. The next prime is 51080011. The reversal of 51080000 is 8015.
It can be written as a sum of positive squares in 5 ways, for example, as 16128256 + 34951744 = 4016^2 + 5912^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 39362 + ... + 40638.
Almost surely, 251080000 is an apocalyptic number.
51080000 is a gapful number since it is divisible by the number (50) 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 51080000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63380493).
51080000 is an abundant number, since it is smaller than the sum of its proper divisors (75680986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51080000 is an equidigital number, since it uses as much as digits as its factorization.
51080000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1309 (or 1284 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 51080000 is about 7147.0273540823. The cubic root of 51080000 is about 371.0367804513.
Adding to 51080000 its reverse (8015), we get a palindrome (51088015).
The spelling of 51080000 in words is "fifty-one million, eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •