Base | Representation |
---|---|
bin | 100100101111101011011101… |
… | …011101101001100101111100 |
3 | 210012012101201210201202122221 |
4 | 210233223131131221211330 |
5 | 132140223401141012242 |
6 | 1331412502005215124 |
7 | 46016442113515540 |
oct | 4457533535514574 |
9 | 705171653652587 |
10 | 161606155016572 |
11 | 47546870496822 |
12 | 161604324014a4 |
13 | 6c23519b505b6 |
14 | 2bc9acb477a20 |
15 | 13a3b30eb0167 |
hex | 92fadd76997c |
161606155016572 has 48 divisors (see below), whose sum is σ = 330743622730752. Its totient is φ = 67646071644480.
The previous prime is 161606155016569. The next prime is 161606155016573. The reversal of 161606155016572 is 275610551606161.
It is a super-2 number, since 2×1616061550165722 (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 (161606155016573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24121938 + ... + 30084550.
It is an arithmetic number, because the mean of its divisors is an integer number (6890492140224).
Almost surely, 2161606155016572 is an apocalyptic number.
It is an amenable number.
161606155016572 is an abundant number, since it is smaller than the sum of its proper divisors (169137467714180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161606155016572 is a wasteful number, since it uses less digits than its factorization.
161606155016572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5985178 (or 5985176 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 52.
The spelling of 161606155016572 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred fifty-five million, sixteen thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •