Base | Representation |
---|---|
bin | 10010101010000011010111 |
3 | 100012110222012 |
4 | 102222003113 |
5 | 2223001324 |
6 | 252454435 |
7 | 56400002 |
oct | 22520327 |
9 | 10173865 |
10 | 4890839 |
11 | 2840618 |
12 | 177a41b |
13 | 10231b5 |
14 | 914539 |
15 | 66920e |
hex | 4aa0d7 |
4890839 has 4 divisors (see below), whose sum is σ = 5048640. Its totient is φ = 4733040.
The previous prime is 4890833. The next prime is 4890841. The reversal of 4890839 is 9380984.
4890839 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4890839 is a prime.
It is a super-2 number, since 2×48908392 = 47840612247842, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4890796 and 4890805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4890833) 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 3 ways as a sum of consecutive naturals, for example, 78854 + ... + 78915.
It is an arithmetic number, because the mean of its divisors is an integer number (1262160).
Almost surely, 24890839 is an apocalyptic number.
4890839 is a deficient number, since it is larger than the sum of its proper divisors (157801).
4890839 is a wasteful number, since it uses less digits than its factorization.
4890839 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157800.
The product of its (nonzero) digits is 62208, while the sum is 41.
The square root of 4890839 is about 2211.5241350707. The cubic root of 4890839 is about 169.7440091789.
The spelling of 4890839 in words is "four million, eight hundred ninety thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •