Base | Representation |
---|---|
bin | 1101101110010… |
… | …0111011100000 |
3 | 11000022101120111 |
4 | 3123210323200 |
5 | 104213421200 |
6 | 5413421104 |
7 | 1266154513 |
oct | 333447340 |
9 | 130271514 |
10 | 57560800 |
11 | 2a545310 |
12 | 1733a794 |
13 | bc0495b |
14 | 7904d7a |
15 | 50c00ba |
hex | 36e4ee0 |
57560800 has 144 divisors (see below), whose sum is σ = 158989824. Its totient is φ = 20160000.
The previous prime is 57560791. The next prime is 57560801. The reversal of 57560800 is 806575.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57560801) 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, 272695 + ... + 272905.
It is an arithmetic number, because the mean of its divisors is an integer number (1104096).
Almost surely, 257560800 is an apocalyptic number.
57560800 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 57560800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79494912).
57560800 is an abundant number, since it is smaller than the sum of its proper divisors (101429024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57560800 is a wasteful number, since it uses less digits than its factorization.
57560800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273 (or 260 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 57560800 is about 7586.8834181105. The cubic root of 57560800 is about 386.1081247385.
The spelling of 57560800 in words is "fifty-seven million, five hundred sixty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •