Base | Representation |
---|---|
bin | 10011110100000… |
… | …00111111100001 |
3 | 102120202000011001 |
4 | 21322000333201 |
5 | 320022001421 |
6 | 24254152001 |
7 | 4055463622 |
oct | 1172007741 |
9 | 376660131 |
10 | 166203361 |
11 | 858aa055 |
12 | 477b2601 |
13 | 285831ac |
14 | 18105a49 |
15 | e8d0691 |
hex | 9e80fe1 |
166203361 has 2 divisors, whose sum is σ = 166203362. Its totient is φ = 166203360.
The previous prime is 166203347. The next prime is 166203397. The reversal of 166203361 is 163302661.
166203361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101304225 + 64899136 = 10065^2 + 8056^2 .
It is an emirp because it is prime and its reverse (163302661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 166203361 - 25 = 166203329 is a prime.
It is a Chen prime.
It is equal to p9302356 and since 166203361 and 9302356 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (166203341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83101680 + 83101681.
It is an arithmetic number, because the mean of its divisors is an integer number (83101681).
Almost surely, 2166203361 is an apocalyptic number.
It is an amenable number.
166203361 is a deficient number, since it is larger than the sum of its proper divisors (1).
166203361 is an equidigital number, since it uses as much as digits as its factorization.
166203361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 166203361 is about 12891.9882485209. The cubic root of 166203361 is about 549.8108010391.
The spelling of 166203361 in words is "one hundred sixty-six million, two hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •