Base | Representation |
---|---|
bin | 10100101110110010101011 |
3 | 101020002210020 |
4 | 110232302223 |
5 | 2342401124 |
6 | 312251523 |
7 | 64123065 |
oct | 24566253 |
9 | 11202706 |
10 | 5434539 |
11 | 3082060 |
12 | 19a0ba3 |
13 | 1183806 |
14 | a16735 |
15 | 725379 |
hex | 52ecab |
5434539 has 8 divisors (see below), whose sum is σ = 7904832. Its totient is φ = 3293640.
The previous prime is 5434537. The next prime is 5434573. The reversal of 5434539 is 9354345.
5434539 = 572 + 582 + ... + 2542.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5434539 - 21 = 5434537 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 164683 = 5434539 / (5 + 4 + 3 + 4 + 5 + 3 + 9).
It is not an unprimeable number, because it can be changed into a prime (5434531) 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 7 ways as a sum of consecutive naturals, for example, 82309 + ... + 82374.
It is an arithmetic number, because the mean of its divisors is an integer number (988104).
Almost surely, 25434539 is an apocalyptic number.
5434539 is a deficient number, since it is larger than the sum of its proper divisors (2470293).
5434539 is a wasteful number, since it uses less digits than its factorization.
5434539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164697.
The product of its digits is 32400, while the sum is 33.
The square root of 5434539 is about 2331.2097717709. The cubic root of 5434539 is about 175.8143164797.
The spelling of 5434539 in words is "five million, four hundred thirty-four thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •