Base | Representation |
---|---|
bin | 1001011000010000010… |
… | …1101101110100010101 |
3 | 120101220102022001010221 |
4 | 2112010011231310111 |
5 | 10114443222141403 |
6 | 202004432314341 |
7 | 14432643250324 |
oct | 2260405556425 |
9 | 511812261127 |
10 | 161129880853 |
11 | 62375687397 |
12 | 2728a0a29b1 |
13 | 1226b380286 |
14 | 7b279d00bb |
15 | 42d0c76dbd |
hex | 258416dd15 |
161129880853 has 2 divisors, whose sum is σ = 161129880854. Its totient is φ = 161129880852.
The previous prime is 161129880851. The next prime is 161129880887. The reversal of 161129880853 is 358088921161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152406694449 + 8723186404 = 390393^2 + 93398^2 .
It is a cyclic number.
It is not a de Polignac number, because 161129880853 - 21 = 161129880851 is a prime.
Together with 161129880851, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 161129880853.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161129880851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80564940426 + 80564940427.
It is an arithmetic number, because the mean of its divisors is an integer number (80564940427).
Almost surely, 2161129880853 is an apocalyptic number.
It is an amenable number.
161129880853 is a deficient number, since it is larger than the sum of its proper divisors (1).
161129880853 is an equidigital number, since it uses as much as digits as its factorization.
161129880853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 52.
The spelling of 161129880853 in words is "one hundred sixty-one billion, one hundred twenty-nine million, eight hundred eighty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •