Base | Representation |
---|---|
bin | 10011010000011… |
… | …00000111111001 |
3 | 102020221120222222 |
4 | 21220030013321 |
5 | 312322432421 |
6 | 24010053425 |
7 | 4000661666 |
oct | 1150140771 |
9 | 366846888 |
10 | 161530361 |
11 | 831a8173 |
12 | 4611a275 |
13 | 276081c5 |
14 | 1764aa6d |
15 | e2aacab |
hex | 9a0c1f9 |
161530361 has 2 divisors, whose sum is σ = 161530362. Its totient is φ = 161530360.
The previous prime is 161530333. The next prime is 161530387. The reversal of 161530361 is 163035161.
It is an a-pointer prime, because the next prime (161530387) can be obtained adding 161530361 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98883136 + 62647225 = 9944^2 + 7915^2 .
It is a cyclic number.
It is not a de Polignac number, because 161530361 - 210 = 161529337 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161530361.
It is not a weakly prime, because it can be changed into another prime (161530331) 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, 80765180 + 80765181.
It is an arithmetic number, because the mean of its divisors is an integer number (80765181).
Almost surely, 2161530361 is an apocalyptic number.
It is an amenable number.
161530361 is a deficient number, since it is larger than the sum of its proper divisors (1).
161530361 is an equidigital number, since it uses as much as digits as its factorization.
161530361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 161530361 is about 12709.4595085708. The cubic root of 161530361 is about 544.6088835963.
The spelling of 161530361 in words is "one hundred sixty-one million, five hundred thirty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •