Base | Representation |
---|---|
bin | 10101011001011010000000 |
3 | 101112222020000 |
4 | 111121122000 |
5 | 2413442323 |
6 | 320120000 |
7 | 65451012 |
oct | 25313200 |
9 | 11488200 |
10 | 5609088 |
11 | 3191211 |
12 | 1a66000 |
13 | 12150b4 |
14 | a601b2 |
15 | 75be43 |
hex | 559680 |
5609088 has 80 divisors (see below), whose sum is σ = 16723410. Its totient is φ = 1866240.
The previous prime is 5609083. The next prime is 5609111. The reversal of 5609088 is 8809065.
5609088 is a `hidden beast` number, since 560 + 90 + 8 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4981824 + 627264 = 2232^2 + 792^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (5609083) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10098 + ... + 10638.
Almost surely, 25609088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5609088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8361705).
5609088 is an abundant number, since it is smaller than the sum of its proper divisors (11114322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5609088 is an equidigital number, since it uses as much as digits as its factorization.
5609088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567 (or 546 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 5609088 is about 2368.3513252894. The cubic root of 5609088 is about 177.6768111867.
The spelling of 5609088 in words is "five million, six hundred nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •