Base | Representation |
---|---|
bin | 11000010110001… |
… | …10100101101001 |
3 | 112020022022201022 |
4 | 30023012211221 |
5 | 404241042121 |
6 | 32133302225 |
7 | 5026662422 |
oct | 1413064551 |
9 | 466268638 |
10 | 204237161 |
11 | a5317447 |
12 | 58494975 |
13 | 3340babb |
14 | 1d1a6649 |
15 | 12de4aab |
hex | c2c6969 |
204237161 has 2 divisors, whose sum is σ = 204237162. Its totient is φ = 204237160.
The previous prime is 204237157. The next prime is 204237179. The reversal of 204237161 is 161732402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109077136 + 95160025 = 10444^2 + 9755^2 .
It is a cyclic number.
It is not a de Polignac number, because 204237161 - 22 = 204237157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 204237161.
It is not a weakly prime, because it can be changed into another prime (204237101) 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, 102118580 + 102118581.
It is an arithmetic number, because the mean of its divisors is an integer number (102118581).
Almost surely, 2204237161 is an apocalyptic number.
It is an amenable number.
204237161 is a deficient number, since it is larger than the sum of its proper divisors (1).
204237161 is an equidigital number, since it uses as much as digits as its factorization.
204237161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 204237161 is about 14291.1567411459. The cubic root of 204237161 is about 588.9045660805.
Adding to 204237161 its reverse (161732402), we get a palindrome (365969563).
The spelling of 204237161 in words is "two hundred four million, two hundred thirty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •