Base | Representation |
---|---|
bin | 10101111111100101111100 |
3 | 101211220210001 |
4 | 111333211330 |
5 | 2433444000 |
6 | 323324044 |
7 | 100002016 |
oct | 25774574 |
9 | 11756701 |
10 | 5765500 |
11 | 3288784 |
12 | 1b20624 |
13 | 126b350 |
14 | aa11b6 |
15 | 78d46a |
hex | 57f97c |
5765500 has 48 divisors (see below), whose sum is σ = 13575744. Its totient is φ = 2126400.
The previous prime is 5765497. The next prime is 5765503. The reversal of 5765500 is 55675.
It is an interprime number because it is at equal distance from previous prime (5765497) and next prime (5765503).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5765503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6057 + ... + 6943.
It is an arithmetic number, because the mean of its divisors is an integer number (282828).
Almost surely, 25765500 is an apocalyptic number.
5765500 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 5765500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6787872).
5765500 is an abundant number, since it is smaller than the sum of its proper divisors (7810244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5765500 is a wasteful number, since it uses less digits than its factorization.
5765500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919 (or 907 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 28.
The square root of 5765500 is about 2401.1455599359. The cubic root of 5765500 is about 179.3132266336.
The spelling of 5765500 in words is "five million, seven hundred sixty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.423 sec. • engine limits •