Base | Representation |
---|---|
bin | 10011010100101100011100 |
3 | 100112100120010 |
4 | 103110230130 |
5 | 2244044000 |
6 | 300323220 |
7 | 61025136 |
oct | 23245434 |
9 | 10470503 |
10 | 5065500 |
11 | 294a870 |
12 | 1843510 |
13 | 108484b |
14 | 95c056 |
15 | 6a0d50 |
hex | 4d4b1c |
5065500 has 96 divisors (see below), whose sum is σ = 16144128. Its totient is φ = 1224000.
The previous prime is 5065481. The next prime is 5065531. The reversal of 5065500 is 55605.
It is a congruent number.
It is an unprimeable number.
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, 16347 + ... + 16653.
It is an arithmetic number, because the mean of its divisors is an integer number (168168).
Almost surely, 25065500 is an apocalyptic number.
5065500 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 5065500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8072064).
5065500 is an abundant number, since it is smaller than the sum of its proper divisors (11078628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5065500 is a wasteful number, since it uses less digits than its factorization.
5065500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340 (or 328 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 21.
The square root of 5065500 is about 2250.6665679305. Note that the first 3 decimals coincide. The cubic root of 5065500 is about 171.7410471445.
It can be divided in two parts, 5065 and 500, that added together give a triangular number (5565 = T105).
The spelling of 5065500 in words is "five million, sixty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •