Base | Representation |
---|---|
bin | 1011110001101001… |
… | …0010111111110001 |
3 | 22011021222221202102 |
4 | 2330122102333301 |
5 | 22433204311121 |
6 | 1241355230145 |
7 | 141222100031 |
oct | 27432227761 |
9 | 8137887672 |
10 | 3161010161 |
11 | 13823427a1 |
12 | 742748355 |
13 | 3b4b69a1a |
14 | 21db598c1 |
15 | 13779a90b |
hex | bc692ff1 |
3161010161 has 2 divisors, whose sum is σ = 3161010162. Its totient is φ = 3161010160.
The previous prime is 3161010113. The next prime is 3161010191. The reversal of 3161010161 is 1610101613.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1635717136 + 1525293025 = 40444^2 + 39055^2 .
It is an emirp because it is prime and its reverse (1610101613) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3161010161 - 214 = 3160993777 is a prime.
It is not a weakly prime, because it can be changed into another prime (3161010191) 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, 1580505080 + 1580505081.
It is an arithmetic number, because the mean of its divisors is an integer number (1580505081).
Almost surely, 23161010161 is an apocalyptic number.
It is an amenable number.
3161010161 is a deficient number, since it is larger than the sum of its proper divisors (1).
3161010161 is an equidigital number, since it uses as much as digits as its factorization.
3161010161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The square root of 3161010161 is about 56222.8615511519. The cubic root of 3161010161 is about 1467.6031344156.
Adding to 3161010161 its reverse (1610101613), we get a palindrome (4771111774).
The spelling of 3161010161 in words is "three billion, one hundred sixty-one million, ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •