Base | Representation |
---|---|
bin | 10010100010001001111101 |
3 | 100010211121012 |
4 | 102202021331 |
5 | 2220432433 |
6 | 252045005 |
7 | 56203463 |
oct | 22421175 |
9 | 10124535 |
10 | 4858493 |
11 | 2819292 |
12 | 1763765 |
13 | 1011563 |
14 | 906833 |
15 | 65e848 |
hex | 4a227d |
4858493 has 2 divisors, whose sum is σ = 4858494. Its totient is φ = 4858492.
The previous prime is 4858487. The next prime is 4858499. The reversal of 4858493 is 3948584.
It is a balanced prime because it is at equal distance from previous prime (4858487) and next prime (4858499).
It can be written as a sum of positive squares in only one way, i.e., 4826809 + 31684 = 2197^2 + 178^2 .
It is a cyclic number.
It is not a de Polignac number, because 4858493 - 214 = 4842109 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4858493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4858499) 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 as a sum of consecutive naturals, namely, 2429246 + 2429247.
It is an arithmetic number, because the mean of its divisors is an integer number (2429247).
Almost surely, 24858493 is an apocalyptic number.
It is an amenable number.
4858493 is a deficient number, since it is larger than the sum of its proper divisors (1).
4858493 is an equidigital number, since it uses as much as digits as its factorization.
4858493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 138240, while the sum is 41.
The square root of 4858493 is about 2204.1989474637. The cubic root of 4858493 is about 169.3689754714.
Subtracting from 4858493 its reverse (3948584), we obtain a palindrome (909909).
The spelling of 4858493 in words is "four million, eight hundred fifty-eight thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •