Base | Representation |
---|---|
bin | 101111100001100010… |
… | …001101001100100000 |
3 | 11212201021002102001100 |
4 | 233201202031030200 |
5 | 1314001242341200 |
6 | 35235301234400 |
7 | 3454350634023 |
oct | 574142151440 |
9 | 155637072040 |
10 | 51028480800 |
11 | 1a706279990 |
12 | 9a81402a00 |
13 | 4a72b6c54b |
14 | 26811731ba |
15 | 14d9ceed00 |
hex | be188d320 |
51028480800 has 864 divisors, whose sum is σ = 207515468160. Its totient is φ = 11678515200.
The previous prime is 51028480739. The next prime is 51028480829. The reversal of 51028480800 is 808482015.
51028480800 is a `hidden beast` number, since 510 + 28 + 48 + 0 + 80 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 198554272 + ... + 198554528.
It is an arithmetic number, because the mean of its divisors is an integer number (240179940).
Almost surely, 251028480800 is an apocalyptic number.
51028480800 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 51028480800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103757734080).
51028480800 is an abundant number, since it is smaller than the sum of its proper divisors (156486987360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51028480800 is a wasteful number, since it uses less digits than its factorization.
51028480800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426 (or 410 counting only the distinct ones).
The product of its (nonzero) digits is 20480, while the sum is 36.
The spelling of 51028480800 in words is "fifty-one billion, twenty-eight million, four hundred eighty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •