Base | Representation |
---|---|
bin | 10011001110100… |
… | …00010001110101 |
3 | 102020111010202022 |
4 | 21213100101311 |
5 | 312242111422 |
6 | 24000522525 |
7 | 3665621231 |
oct | 1147202165 |
9 | 366433668 |
10 | 161285237 |
11 | 8304aa93 |
12 | 46020445 |
13 | 27550769 |
14 | 175c55c1 |
15 | e25d342 |
hex | 99d0475 |
161285237 has 2 divisors, whose sum is σ = 161285238. Its totient is φ = 161285236.
The previous prime is 161285227. The next prime is 161285263. The reversal of 161285237 is 732582161.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 149181796 + 12103441 = 12214^2 + 3479^2 .
It is an emirp because it is prime and its reverse (732582161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161285237 - 216 = 161219701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 161285197 and 161285206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161285227) 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, 80642618 + 80642619.
It is an arithmetic number, because the mean of its divisors is an integer number (80642619).
Almost surely, 2161285237 is an apocalyptic number.
It is an amenable number.
161285237 is a deficient number, since it is larger than the sum of its proper divisors (1).
161285237 is an equidigital number, since it uses as much as digits as its factorization.
161285237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20160, while the sum is 35.
The square root of 161285237 is about 12699.8124789305. The cubic root of 161285237 is about 544.3332609173. Note that the first 3 decimals are identical.
The spelling of 161285237 in words is "one hundred sixty-one million, two hundred eighty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •