Base | Representation |
---|---|
bin | 10101111101100001001000 |
3 | 101211111010020 |
4 | 111331201020 |
5 | 2433211000 |
6 | 323220440 |
7 | 66635154 |
oct | 25754110 |
9 | 11744106 |
10 | 5757000 |
11 | 3282357 |
12 | 1b17720 |
13 | 1267512 |
14 | a9c064 |
15 | 78aba0 |
hex | 57d848 |
5757000 has 128 divisors (see below), whose sum is σ = 19094400. Its totient is φ = 1440000.
The previous prime is 5756987. The next prime is 5757001. The reversal of 5757000 is 7575.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5757001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56950 + ... + 57050.
It is an arithmetic number, because the mean of its divisors is an integer number (149175).
Almost surely, 25757000 is an apocalyptic number.
5757000 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 5757000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9547200).
5757000 is an abundant number, since it is smaller than the sum of its proper divisors (13337400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5757000 is a wasteful number, since it uses less digits than its factorization.
5757000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 130 counting only the distinct ones).
The product of its (nonzero) digits is 1225, while the sum is 24.
The square root of 5757000 is about 2399.3749185986. The cubic root of 5757000 is about 179.2250635915.
The spelling of 5757000 in words is "five million, seven hundred fifty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •