Base | Representation |
---|---|
bin | 100100101101000010100111… |
… | …110010110111011011011101 |
3 | 210011120001210110102121122111 |
4 | 210231002213302313123131 |
5 | 132124241111142412143 |
6 | 1331153320520114021 |
7 | 46000363443245623 |
oct | 4455024762673335 |
9 | 704501713377574 |
10 | 161424865982173 |
11 | 474869a0566a62 |
12 | 16131279005911 |
13 | 6c0c3b8140301 |
14 | 2bc10103b3513 |
15 | 139e07053099d |
hex | 92d0a7cb76dd |
161424865982173 has 2 divisors, whose sum is σ = 161424865982174. Its totient is φ = 161424865982172.
The previous prime is 161424865982153. The next prime is 161424865982183. The reversal of 161424865982173 is 371289568424161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124469433488569 + 36955432493604 = 11156587^2 + 6079098^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161424865982173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 161424865982099 and 161424865982108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161424865982153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80712432991086 + 80712432991087.
It is an arithmetic number, because the mean of its divisors is an integer number (80712432991087).
Almost surely, 2161424865982173 is an apocalyptic number.
It is an amenable number.
161424865982173 is a deficient number, since it is larger than the sum of its proper divisors (1).
161424865982173 is an equidigital number, since it uses as much as digits as its factorization.
161424865982173 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139345920, while the sum is 67.
The spelling of 161424865982173 in words is "one hundred sixty-one trillion, four hundred twenty-four billion, eight hundred sixty-five million, nine hundred eighty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •