Base | Representation |
---|---|
bin | 1101100101011… |
… | …1010101000000 |
3 | 10222012220222000 |
4 | 3121113111000 |
5 | 104041341200 |
6 | 5353144000 |
7 | 1261220532 |
oct | 331272500 |
9 | 128186860 |
10 | 56980800 |
11 | 2a189578 |
12 | 170bb000 |
13 | ba60966 |
14 | 77d3852 |
15 | 5008300 |
hex | 3657540 |
56980800 has 168 divisors, whose sum is σ = 207873600. Its totient is φ = 15183360.
The previous prime is 56980799. The next prime is 56980801. The reversal of 56980800 is 808965.
It is an interprime number because it is at equal distance from previous prime (56980799) and next prime (56980801).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56980801) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42541 + ... + 43859.
Almost surely, 256980800 is an apocalyptic number.
56980800 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 56980800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103936800).
56980800 is an abundant number, since it is smaller than the sum of its proper divisors (150892800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56980800 is a wasteful number, since it uses less digits than its factorization.
56980800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1350 (or 1329 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 56980800 is about 7548.5627771119. The cubic root of 56980800 is about 384.8068970342.
The spelling of 56980800 in words is "fifty-six million, nine hundred eighty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •