Base | Representation |
---|---|
bin | 10011011000001010111001 |
3 | 100120002002102 |
4 | 103120022321 |
5 | 2300022422 |
6 | 300513145 |
7 | 61114505 |
oct | 23301271 |
9 | 10502072 |
10 | 5079737 |
11 | 295a533 |
12 | 184b7b5 |
13 | 108b180 |
14 | 963305 |
15 | 6a5192 |
hex | 4d82b9 |
5079737 has 8 divisors (see below), whose sum is σ = 5490240. Its totient is φ = 4672080.
The previous prime is 5079731. The next prime is 5079743. The reversal of 5079737 is 7379705.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5079731) and next prime (5079743).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5079737 - 26 = 5079673 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5079737.
It is not an unprimeable number, because it can be changed into a prime (5079731) 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 7 ways as a sum of consecutive naturals, for example, 4412 + ... + 5442.
It is an arithmetic number, because the mean of its divisors is an integer number (686280).
Almost surely, 25079737 is an apocalyptic number.
It is an amenable number.
5079737 is a deficient number, since it is larger than the sum of its proper divisors (410503).
5079737 is a wasteful number, since it uses less digits than its factorization.
5079737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423.
The product of its (nonzero) digits is 46305, while the sum is 38.
The square root of 5079737 is about 2253.8271894713. The cubic root of 5079737 is about 171.9017940377.
Subtracting 5079737 from its reverse (7379705), we obtain a cube (2299968 = 1323).
The spelling of 5079737 in words is "five million, seventy-nine thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •