Base | Representation |
---|---|
bin | 10101011001001001110010 |
3 | 101112220210120 |
4 | 111121021302 |
5 | 2413424200 |
6 | 320111110 |
7 | 65445000 |
oct | 25311162 |
9 | 11486716 |
10 | 5608050 |
11 | 3190458 |
12 | 1a65496 |
13 | 1214796 |
14 | a5da70 |
15 | 75b9a0 |
hex | 559272 |
5608050 has 96 divisors (see below), whose sum is σ = 16368000. Its totient is φ = 1270080.
The previous prime is 5608039. The next prime is 5608051. The reversal of 5608050 is 508065.
It is a self number, because there is not a number n which added to its sum of digits gives 5608050.
It is not an unprimeable number, because it can be changed into a prime (5608051) 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 47 ways as a sum of consecutive naturals, for example, 51396 + ... + 51504.
It is an arithmetic number, because the mean of its divisors is an integer number (170500).
Almost surely, 25608050 is an apocalyptic number.
5608050 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 5608050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8184000).
5608050 is an abundant number, since it is smaller than the sum of its proper divisors (10759950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5608050 is a wasteful number, since it uses less digits than its factorization.
5608050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145 (or 126 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 5608050 is about 2368.1321753652. The cubic root of 5608050 is about 177.6658504085.
The spelling of 5608050 in words is "five million, six hundred eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •