Base | Representation |
---|---|
bin | 100100101111100110101011… |
… | …001000011001001000111101 |
3 | 210012011220110122001011112212 |
4 | 210233212223020121020331 |
5 | 132140132334444203221 |
6 | 1331410252014110205 |
7 | 46016200546365560 |
oct | 4457465310311075 |
9 | 705156418034485 |
10 | 161601015616061 |
11 | 4754467342708a |
12 | 1615b4391ab365 |
13 | 6c22bab1644c8 |
14 | 2bc9760a8a4d7 |
15 | 13a392ebbeb5b |
hex | 92f9ab21923d |
161601015616061 has 16 divisors (see below), whose sum is σ = 187971489578880. Its totient is φ = 136055553515520.
The previous prime is 161601015616039. The next prime is 161601015616069. The reversal of 161601015616061 is 160616510106161.
161601015616061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 161601015616061 - 226 = 161600948507197 is a prime.
It is a super-2 number, since 2×1616010156160612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161601015616069) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160255700 + ... + 161260941.
It is an arithmetic number, because the mean of its divisors is an integer number (11748218098680).
Almost surely, 2161601015616061 is an apocalyptic number.
It is an amenable number.
161601015616061 is a deficient number, since it is larger than the sum of its proper divisors (26370473962819).
161601015616061 is a wasteful number, since it uses less digits than its factorization.
161601015616061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321517924.
The product of its (nonzero) digits is 38880, while the sum is 41.
The spelling of 161601015616061 in words is "one hundred sixty-one trillion, six hundred one billion, fifteen million, six hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •