Base | Representation |
---|---|
bin | 100100101111101011111000… |
… | …000011001010111100010000 |
3 | 210012012102212220001010101001 |
4 | 210233223320003022330100 |
5 | 132140230304332410422 |
6 | 1331413014141351344 |
7 | 46016456141026165 |
oct | 4457537003127420 |
9 | 705172786033331 |
10 | 161606601060112 |
11 | 47546a7a24a94a |
12 | 16160537868554 |
13 | 6c2358b3934a0 |
14 | 2bc9b307c606c |
15 | 13a3b5a21b227 |
hex | 92faf80caf10 |
161606601060112 has 40 divisors (see below), whose sum is σ = 337199531270616. Its totient is φ = 74587409304576.
The previous prime is 161606601060103. The next prime is 161606601060133. The reversal of 161606601060112 is 211060106606161.
It can be written as a sum of positive squares in 4 ways, for example, as 47215533278736 + 114391067781376 = 6871356^2 + 10695376^2 .
It is a super-2 number, since 2×1616066010601122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 69306228 + ... + 71600044.
Almost surely, 2161606601060112 is an apocalyptic number.
It is an amenable number.
161606601060112 is an abundant number, since it is smaller than the sum of its proper divisors (175592930210504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161606601060112 is a wasteful number, since it uses less digits than its factorization.
161606601060112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2632555 (or 2632549 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 37.
Adding to 161606601060112 its reverse (211060106606161), we get a palindrome (372666707666273).
The spelling of 161606601060112 in words is "one hundred sixty-one trillion, six hundred six billion, six hundred one million, sixty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •