Base | Representation |
---|---|
bin | 100100100111010101001010… |
… | …101001001010000111010001 |
3 | 210010011112221002110211212001 |
4 | 210213111022221022013101 |
5 | 132101323440022212431 |
6 | 1330253142534234001 |
7 | 45630132335123356 |
oct | 4447251251120721 |
9 | 703145832424761 |
10 | 161032461132241 |
11 | 47345535224296 |
12 | 160892054b5901 |
13 | 6bb13b01c610a |
14 | 2baa026c1062d |
15 | 1393c55811e61 |
hex | 92754aa4a1d1 |
161032461132241 has 2 divisors, whose sum is σ = 161032461132242. Its totient is φ = 161032461132240.
The previous prime is 161032461132229. The next prime is 161032461132293. The reversal of 161032461132241 is 142231164230161.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105020274243600 + 56012186888641 = 10247940^2 + 7484129^2 .
It is a cyclic number.
It is not a de Polignac number, because 161032461132241 - 223 = 161032452743633 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161032461132241.
It is not a weakly prime, because it can be changed into another prime (161032461132841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80516230566120 + 80516230566121.
It is an arithmetic number, because the mean of its divisors is an integer number (80516230566121).
Almost surely, 2161032461132241 is an apocalyptic number.
It is an amenable number.
161032461132241 is a deficient number, since it is larger than the sum of its proper divisors (1).
161032461132241 is an equidigital number, since it uses as much as digits as its factorization.
161032461132241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 161032461132241 in words is "one hundred sixty-one trillion, thirty-two billion, four hundred sixty-one million, one hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •