Base | Representation |
---|---|
bin | 10011101110000110110110 |
3 | 100201122100022 |
4 | 103232012312 |
5 | 2310411330 |
6 | 302445142 |
7 | 61640456 |
oct | 23560666 |
9 | 10648308 |
10 | 5169590 |
11 | 2a10a98 |
12 | 18937b2 |
13 | 10c003a |
14 | 987d66 |
15 | 6c1ae5 |
hex | 4ee1b6 |
5169590 has 8 divisors (see below), whose sum is σ = 9305280. Its totient is φ = 2067832.
The previous prime is 5169583. The next prime is 5169599. The reversal of 5169590 is 959615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5169590.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5169599) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 258470 + ... + 258489.
It is an arithmetic number, because the mean of its divisors is an integer number (1163160).
Almost surely, 25169590 is an apocalyptic number.
5169590 is a deficient number, since it is larger than the sum of its proper divisors (4135690).
5169590 is a wasteful number, since it uses less digits than its factorization.
5169590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516966.
The product of its (nonzero) digits is 12150, while the sum is 35.
The square root of 5169590 is about 2273.6732394959. The cubic root of 5169590 is about 172.9094383843.
The spelling of 5169590 in words is "five million, one hundred sixty-nine thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.275 sec. • engine limits •