Base | Representation |
---|---|
bin | 10010011100110010001101 |
3 | 100002201102101 |
4 | 102130302031 |
5 | 2214231433 |
6 | 251355101 |
7 | 56052364 |
oct | 22346215 |
9 | 10081371 |
10 | 4836493 |
11 | 2803802 |
12 | 1752a91 |
13 | 100453c |
14 | 8dc7db |
15 | 65807d |
hex | 49cc8d |
4836493 has 4 divisors (see below), whose sum is σ = 4894848. Its totient is φ = 4778140.
The previous prime is 4836467. The next prime is 4836497. The reversal of 4836493 is 3946384.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4836493 is a prime.
It is a d-powerful number, because it can be written as 43 + 83 + 37 + 66 + 46 + 9 + 314 .
It is a Duffinian number.
4836493 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4836497) 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, 29053 + ... + 29218.
It is an arithmetic number, because the mean of its divisors is an integer number (1223712).
Almost surely, 24836493 is an apocalyptic number.
It is an amenable number.
4836493 is a deficient number, since it is larger than the sum of its proper divisors (58355).
4836493 is an equidigital number, since it uses as much as digits as its factorization.
4836493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58354.
The product of its digits is 62208, while the sum is 37.
The square root of 4836493 is about 2199.2028101110. The cubic root of 4836493 is about 169.1129457523.
It can be divided in two parts, 4836 and 493, that added together give a square (5329 = 732).
The spelling of 4836493 in words is "four million, eight hundred thirty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •