Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …100101001001101110010001 |
3 | 210012012101121102201120022100 |
4 | 210233223122211021232101 |
5 | 132140223301300322122 |
6 | 1331412453120431013 |
7 | 46016440655440602 |
oct | 4457533245115621 |
9 | 705171542646270 |
10 | 161606106651537 |
11 | 47546846162419 |
12 | 1616041a178469 |
13 | 6c2350cb18432 |
14 | 2bc9ac4c87da9 |
15 | 13a3b2bb09aac |
hex | 92fada949b91 |
161606106651537 has 12 divisors (see below), whose sum is σ = 233466416726400. Its totient is φ = 107721078071928.
The previous prime is 161606106651467. The next prime is 161606106651541. The reversal of 161606106651537 is 735156601606161.
161606106651537 is a `hidden beast` number, since 1 + 6 + 1 + 6 + 0 + 61 + 0 + 66 + 515 + 3 + 7 = 666.
It is not a de Polignac number, because 161606106651537 - 244 = 144013920607121 is a prime.
It is a super-2 number, since 2×1616061066515372 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (161606106651137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1360467513 + ... + 1360586294.
It is an arithmetic number, because the mean of its divisors is an integer number (19455534727200).
Almost surely, 2161606106651537 is an apocalyptic number.
It is an amenable number.
161606106651537 is a deficient number, since it is larger than the sum of its proper divisors (71860310074863).
161606106651537 is a wasteful number, since it uses less digits than its factorization.
161606106651537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2721060412 (or 2721060409 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 54.
The spelling of 161606106651537 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred six million, six hundred fifty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •