Base | Representation |
---|---|
bin | 10011001111111… |
… | …10111000111101 |
3 | 102020211211122102 |
4 | 21213332320331 |
5 | 312314214112 |
6 | 24004554445 |
7 | 4000344653 |
oct | 1147767075 |
9 | 366754572 |
10 | 161476157 |
11 | 83170477 |
12 | 460b2a25 |
13 | 275b962b |
14 | 17634dd3 |
15 | e299bc2 |
hex | 99fee3d |
161476157 has 2 divisors, whose sum is σ = 161476158. Its totient is φ = 161476156.
The previous prime is 161476111. The next prime is 161476199. The reversal of 161476157 is 751674161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96609241 + 64866916 = 9829^2 + 8054^2 .
It is a cyclic number.
It is not a de Polignac number, because 161476157 - 26 = 161476093 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 161476157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161478157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80738078 + 80738079.
It is an arithmetic number, because the mean of its divisors is an integer number (80738079).
Almost surely, 2161476157 is an apocalyptic number.
It is an amenable number.
161476157 is a deficient number, since it is larger than the sum of its proper divisors (1).
161476157 is an equidigital number, since it uses as much as digits as its factorization.
161476157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 35280, while the sum is 38.
The square root of 161476157 is about 12707.3269022246. The cubic root of 161476157 is about 544.5479594820.
The spelling of 161476157 in words is "one hundred sixty-one million, four hundred seventy-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •