Base | Representation |
---|---|
bin | 10011001111000… |
… | …01110110001101 |
3 | 102020121210110111 |
4 | 21213201312031 |
5 | 312301412242 |
6 | 24002240021 |
7 | 3666341101 |
oct | 1147416615 |
9 | 366553414 |
10 | 161357197 |
11 | 8309a061 |
12 | 46056011 |
13 | 27577441 |
14 | 17603901 |
15 | e274817 |
hex | 99e1d8d |
161357197 has 2 divisors, whose sum is σ = 161357198. Its totient is φ = 161357196.
The previous prime is 161357179. The next prime is 161357243. The reversal of 161357197 is 791753161.
Together with previous prime (161357179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145588356 + 15768841 = 12066^2 + 3971^2 .
It is a cyclic number.
It is not a de Polignac number, because 161357197 - 211 = 161355149 is a prime.
It is a super-2 number, since 2×1613571972 = 52072290047393618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161357117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80678598 + 80678599.
It is an arithmetic number, because the mean of its divisors is an integer number (80678599).
Almost surely, 2161357197 is an apocalyptic number.
It is an amenable number.
161357197 is a deficient number, since it is larger than the sum of its proper divisors (1).
161357197 is an equidigital number, since it uses as much as digits as its factorization.
161357197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 39690, while the sum is 40.
The square root of 161357197 is about 12702.6452756896. The cubic root of 161357197 is about 544.4142032241.
It can be divided in two parts, 16135 and 7197, that added together give a palindrome (23332).
The spelling of 161357197 in words is "one hundred sixty-one million, three hundred fifty-seven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •