Base | Representation |
---|---|
bin | 10011000110101010000000 |
3 | 100102102200111 |
4 | 103012222000 |
5 | 2240224000 |
6 | 255201104 |
7 | 60365404 |
oct | 23065200 |
9 | 10372614 |
10 | 5008000 |
11 | 2910648 |
12 | 1816194 |
13 | 106461a |
14 | 945104 |
15 | 68dcba |
hex | 4c6a80 |
5008000 has 64 divisors (see below), whose sum is σ = 12490920. Its totient is φ = 1996800.
The previous prime is 5007983. The next prime is 5008007. The reversal of 5008000 is 8005.
It can be written as a sum of positive squares in 4 ways, for example, as 238144 + 4769856 = 488^2 + 2184^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (5008007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15844 + ... + 16156.
Almost surely, 25008000 is an apocalyptic number.
5008000 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 5008000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6245460).
5008000 is an abundant number, since it is smaller than the sum of its proper divisors (7482920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5008000 is an equidigital number, since it uses as much as digits as its factorization.
5008000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 342 (or 320 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 5008000 is about 2237.8561169119. The cubic root of 5008000 is about 171.0887447887.
It can be divided in two parts, 500 and 8000, that multiplied together give a square (4000000 = 20002).
The spelling of 5008000 in words is "five million, eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •