Base | Representation |
---|---|
bin | 100000000011… |
… | …0101111111101 |
3 | 1011121202221021 |
4 | 1000012233331 |
5 | 13300223421 |
6 | 1400104141 |
7 | 262560523 |
oct | 100065775 |
9 | 34552837 |
10 | 16804861 |
11 | 9538817 |
12 | 5765051 |
13 | 3635008 |
14 | 2336313 |
15 | 171e341 |
hex | 1006bfd |
16804861 has 2 divisors, whose sum is σ = 16804862. Its totient is φ = 16804860.
The previous prime is 16804859. The next prime is 16804871. The reversal of 16804861 is 16840861.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14584761 + 2220100 = 3819^2 + 1490^2 .
It is an emirp because it is prime and its reverse (16840861) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16804861 - 21 = 16804859 is a prime.
Together with 16804859, it forms a pair of twin primes.
It is equal to p1079548 and since 16804861 and 1079548 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16804841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8402430 + 8402431.
It is an arithmetic number, because the mean of its divisors is an integer number (8402431).
Almost surely, 216804861 is an apocalyptic number.
It is an amenable number.
16804861 is a deficient number, since it is larger than the sum of its proper divisors (1).
16804861 is an equidigital number, since it uses as much as digits as its factorization.
16804861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 34.
The square root of 16804861 is about 4099.3732447778. The cubic root of 16804861 is about 256.1405325810.
The spelling of 16804861 in words is "sixteen million, eight hundred four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •