Base | Representation |
---|---|
bin | 110010101001001… |
… | …110000101101101 |
3 | 2012012210112012102 |
4 | 302221032011231 |
5 | 3220003311123 |
6 | 220151144445 |
7 | 30025021361 |
oct | 6251160555 |
9 | 2165715172 |
10 | 849666413 |
11 | 3a6683a52 |
12 | 1b8675125 |
13 | 1070524bb |
14 | 80bb72a1 |
15 | 4e8d8028 |
hex | 32a4e16d |
849666413 has 2 divisors, whose sum is σ = 849666414. Its totient is φ = 849666412.
The previous prime is 849666407. The next prime is 849666431. The reversal of 849666413 is 314666948.
849666413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (849666431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 599172484 + 250493929 = 24478^2 + 15827^2 .
It is a cyclic number.
It is not a de Polignac number, because 849666413 - 216 = 849600877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (849666403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 424833206 + 424833207.
It is an arithmetic number, because the mean of its divisors is an integer number (424833207).
Almost surely, 2849666413 is an apocalyptic number.
It is an amenable number.
849666413 is a deficient number, since it is larger than the sum of its proper divisors (1).
849666413 is an equidigital number, since it uses as much as digits as its factorization.
849666413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 746496, while the sum is 47.
The square root of 849666413 is about 29149.0379429579. The cubic root of 849666413 is about 947.1443008265.
The spelling of 849666413 in words is "eight hundred forty-nine million, six hundred sixty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •