Base | Representation |
---|---|
bin | 1101101111101… |
… | …0101011101100 |
3 | 11000110220210111 |
4 | 3123322223230 |
5 | 104224244100 |
6 | 5415345404 |
7 | 1300005340 |
oct | 333725354 |
9 | 130426714 |
10 | 57649900 |
11 | 2a5a6250 |
12 | 17382264 |
13 | bc36389 |
14 | 7929620 |
15 | 50db6ba |
hex | 36faaec |
57649900 has 72 divisors (see below), whose sum is σ = 155990016. Its totient is φ = 17966400.
The previous prime is 57649897. The next prime is 57649901. The reversal of 57649900 is 994675.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57649901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3957 + ... + 11443.
It is an arithmetic number, because the mean of its divisors is an integer number (2166528).
Almost surely, 257649900 is an apocalyptic number.
57649900 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 57649900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77995008).
57649900 is an abundant number, since it is smaller than the sum of its proper divisors (98340116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57649900 is a wasteful number, since it uses less digits than its factorization.
57649900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7519 (or 7512 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 40.
The square root of 57649900 is about 7592.7531238675. The cubic root of 57649900 is about 386.3072446165.
The spelling of 57649900 in words is "fifty-seven million, six hundred forty-nine thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •