Base | Representation |
---|---|
bin | 10011010000011… |
… | …01010010111001 |
3 | 102020221211120202 |
4 | 21220031102321 |
5 | 312323111121 |
6 | 24010131545 |
7 | 4001011664 |
oct | 1150152271 |
9 | 366854522 |
10 | 161535161 |
11 | 83200837 |
12 | 46120bb5 |
13 | 2760a448 |
14 | 1764c6db |
15 | e2ac40b |
hex | 9a0d4b9 |
161535161 has 2 divisors, whose sum is σ = 161535162. Its totient is φ = 161535160.
The previous prime is 161535151. The next prime is 161535197.
161535161 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113316025 + 48219136 = 10645^2 + 6944^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 161535161 - 218 = 161273017 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (161535151) 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, 80767580 + 80767581.
It is an arithmetic number, because the mean of its divisors is an integer number (80767581).
Almost surely, 2161535161 is an apocalyptic number.
It is an amenable number.
161535161 is a deficient number, since it is larger than the sum of its proper divisors (1).
161535161 is an equidigital number, since it uses as much as digits as its factorization.
161535161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2700, while the sum is 29.
The square root of 161535161 is about 12709.6483428929. The cubic root of 161535161 is about 544.6142780347.
The spelling of 161535161 in words is "one hundred sixty-one million, five hundred thirty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •