Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …100101001001101110010000 |
3 | 210012012101121102201120022022 |
4 | 210233223122211021232100 |
5 | 132140223301300322121 |
6 | 1331412453120431012 |
7 | 46016440655440601 |
oct | 4457533245115620 |
9 | 705171542646268 |
10 | 161606106651536 |
11 | 47546846162418 |
12 | 1616041a178468 |
13 | 6c2350cb18431 |
14 | 2bc9ac4c87da8 |
15 | 13a3b2bb09aab |
hex | 92fada949b90 |
161606106651536 has 10 divisors (see below), whose sum is σ = 313111831637382. Its totient is φ = 80803053325760.
The previous prime is 161606106651467. The next prime is 161606106651541. The reversal of 161606106651536 is 635156601606161.
161606106651536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 113019351675136 + 48586754976400 = 10631056^2 + 6970420^2 .
It is a super-2 number, since 2×1616061066515362 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050190832845 + ... + 5050190832876.
Almost surely, 2161606106651536 is an apocalyptic number.
161606106651536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
161606106651536 is a deficient number, since it is larger than the sum of its proper divisors (151505724985846).
161606106651536 is a wasteful number, since it uses less digits than its factorization.
161606106651536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10100381665729 (or 10100381665723 counting only the distinct ones).
The product of its (nonzero) digits is 3499200, while the sum is 53.
The spelling of 161606106651536 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred six million, six hundred fifty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •