Base | Representation |
---|---|
bin | 10011001111101… |
… | …00110001010101 |
3 | 102020202201210022 |
4 | 21213310301111 |
5 | 312311402314 |
6 | 24004034525 |
7 | 4000113062 |
oct | 1147646125 |
9 | 366681708 |
10 | 161434709 |
11 | 83142317 |
12 | 46092a45 |
13 | 275a37c7 |
14 | 17623c69 |
15 | e28c78e |
hex | 99f4c55 |
161434709 has 2 divisors, whose sum is σ = 161434710. Its totient is φ = 161434708.
The previous prime is 161434699. The next prime is 161434717. The reversal of 161434709 is 907434161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161213809 + 220900 = 12697^2 + 470^2 .
It is an emirp because it is prime and its reverse (907434161) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161434709 is a prime.
It is a super-2 number, since 2×1614347092 = 52122330539829362, which contains 22 as substring.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161434799) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80717354 + 80717355.
It is an arithmetic number, because the mean of its divisors is an integer number (80717355).
Almost surely, 2161434709 is an apocalyptic number.
It is an amenable number.
161434709 is a deficient number, since it is larger than the sum of its proper divisors (1).
161434709 is an equidigital number, since it uses as much as digits as its factorization.
161434709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 35.
The square root of 161434709 is about 12705.6959274178. The cubic root of 161434709 is about 544.5013636344.
The spelling of 161434709 in words is "one hundred sixty-one million, four hundred thirty-four thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •