Base | Representation |
---|---|
bin | 111111101001… |
… | …100000000001 |
3 | 1011101200121002 |
4 | 333221200001 |
5 | 13232410212 |
6 | 1353341345 |
7 | 261551324 |
oct | 77514001 |
9 | 34350532 |
10 | 16685057 |
11 | 9466804 |
12 | 5707855 |
13 | 35c261c |
14 | 23047bb |
15 | 16e8ac2 |
hex | fe9801 |
16685057 has 2 divisors, whose sum is σ = 16685058. Its totient is φ = 16685056.
The previous prime is 16685033. The next prime is 16685069. The reversal of 16685057 is 75058661.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14984641 + 1700416 = 3871^2 + 1304^2 .
It is an emirp because it is prime and its reverse (75058661) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16685057 is a prime.
It is a super-2 number, since 2×166850572 = 556782254186498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16685057.
It is not a weakly prime, because it can be changed into another prime (16685017) 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, 8342528 + 8342529.
It is an arithmetic number, because the mean of its divisors is an integer number (8342529).
Almost surely, 216685057 is an apocalyptic number.
It is an amenable number.
16685057 is a deficient number, since it is larger than the sum of its proper divisors (1).
16685057 is an equidigital number, since it uses as much as digits as its factorization.
16685057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 38.
The square root of 16685057 is about 4084.7346303034. The cubic root of 16685057 is about 255.5303941691.
The spelling of 16685057 in words is "sixteen million, six hundred eighty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •