Base | Representation |
---|---|
bin | 10011010011010000000000 |
3 | 100112001110000 |
4 | 103103100000 |
5 | 2243401314 |
6 | 300240000 |
7 | 61001655 |
oct | 23232000 |
9 | 10461400 |
10 | 5059584 |
11 | 2946382 |
12 | 1840000 |
13 | 1081c4a |
14 | 959c2c |
15 | 69e209 |
hex | 4d3400 |
5059584 has 110 divisors (see below), whose sum is σ = 15356594. Its totient is φ = 1658880.
The previous prime is 5059573. The next prime is 5059619. The reversal of 5059584 is 4859505.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 2985984 + 2073600 = 1728^2 + 1440^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 82914 + ... + 82974.
Almost surely, 25059584 is an apocalyptic number.
5059584 is a gapful number since it is divisible by the number (54) 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 5059584, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7678297).
5059584 is an abundant number, since it is smaller than the sum of its proper divisors (10297010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5059584 is an equidigital number, since it uses as much as digits as its factorization.
5059584 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93 (or 66 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The square root of 5059584 is about 2249.3519066611. The cubic root of 5059584 is about 171.6741622810.
The spelling of 5059584 in words is "five million, fifty-nine thousand, five hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •