Base | Representation |
---|---|
bin | 1101101010011… |
… | …0111010110000 |
3 | 10222211111011002 |
4 | 3122212322300 |
5 | 104132304200 |
6 | 5404141132 |
7 | 1264046135 |
oct | 332467260 |
9 | 128744132 |
10 | 57306800 |
11 | 2a3914a1 |
12 | 172377a8 |
13 | bb46165 |
14 | 787a58c |
15 | 506ebd5 |
hex | 36a6eb0 |
57306800 has 60 divisors (see below), whose sum is σ = 143688720. Its totient is φ = 21922560.
The previous prime is 57306797. The next prime is 57306803. The reversal of 57306800 is 860375.
It is an interprime number because it is at equal distance from previous prime (57306797) and next prime (57306803).
It is not an unprimeable number, because it can be changed into a prime (57306803) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6086 + ... + 12314.
It is an arithmetic number, because the mean of its divisors is an integer number (2394812).
Almost surely, 257306800 is an apocalyptic number.
57306800 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 57306800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71844360).
57306800 is an abundant number, since it is smaller than the sum of its proper divisors (86381920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57306800 is a wasteful number, since it uses less digits than its factorization.
57306800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6270 (or 6259 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 57306800 is about 7570.1254943363. The cubic root of 57306800 is about 385.5393576116.
The spelling of 57306800 in words is "fifty-seven million, three hundred six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •