Base | Representation |
---|---|
bin | 10011000110101010110010 |
3 | 100102102202100 |
4 | 103012222302 |
5 | 2240224200 |
6 | 255201230 |
7 | 60365505 |
oct | 23065262 |
9 | 10372670 |
10 | 5008050 |
11 | 2910693 |
12 | 1816216 |
13 | 1064658 |
14 | 94513c |
15 | 68dd00 |
hex | 4c6ab2 |
5008050 has 72 divisors (see below), whose sum is σ = 13927680. Its totient is φ = 1288800.
The previous prime is 5008021. The next prime is 5008057. The reversal of 5008050 is 508005.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5008057) 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 35 ways as a sum of consecutive naturals, for example, 13771 + ... + 14129.
It is an arithmetic number, because the mean of its divisors is an integer number (193440).
Almost surely, 25008050 is an apocalyptic number.
5008050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5008050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6963840).
5008050 is an abundant number, since it is smaller than the sum of its proper divisors (8919630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5008050 is a wasteful number, since it uses less digits than its factorization.
5008050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408 (or 400 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 5008050 is about 2237.8672882903. The cubic root of 5008050 is about 171.0893141716.
The spelling of 5008050 in words is "five million, eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •