Base | Representation |
---|---|
bin | 100100101111110000000100… |
… | …010011001111010001101101 |
3 | 210012012212111112112111220120 |
4 | 210233300010103033101231 |
5 | 132140314014000103221 |
6 | 1331415040511035153 |
7 | 46020005516504610 |
oct | 4457600423172155 |
9 | 705185445474816 |
10 | 161611101566061 |
11 | 47548979706654 |
12 | 16161392b0bab9 |
13 | 6c23b278b6364 |
14 | 2bca03a3c4177 |
15 | 13a3d203a95c6 |
hex | 92fc044cf46d |
161611101566061 has 32 divisors (see below), whose sum is σ = 256974068533248. Its totient is φ = 88333200436800.
The previous prime is 161611101566051. The next prime is 161611101566087. The reversal of 161611101566061 is 160665101116161.
It is not a de Polignac number, because 161611101566061 - 210 = 161611101565037 is a prime.
It is a super-2 number, since 2×1616111015660612 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161611101566011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52635511 + ... + 55621211.
It is an arithmetic number, because the mean of its divisors is an integer number (8030439641664).
Almost surely, 2161611101566061 is an apocalyptic number.
It is an amenable number.
161611101566061 is a deficient number, since it is larger than the sum of its proper divisors (95362966967187).
161611101566061 is a wasteful number, since it uses less digits than its factorization.
161611101566061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3097801.
The product of its (nonzero) digits is 38880, while the sum is 42.
The spelling of 161611101566061 in words is "one hundred sixty-one trillion, six hundred eleven billion, one hundred one million, five hundred sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •