Base | Representation |
---|---|
bin | 100100101111101011010111… |
… | …100100010110111000101000 |
3 | 210012012101110220121212121220 |
4 | 210233223113210112320220 |
5 | 132140223200331033111 |
6 | 1331412444113302040 |
7 | 46016436503034162 |
oct | 4457532744267050 |
9 | 705171426555556 |
10 | 161606056111656 |
11 | 4754681a683022 |
12 | 16160405264920 |
13 | 6c23502501390 |
14 | 2bc9abc28d932 |
15 | 13a3b27474e06 |
hex | 92fad7916e28 |
161606056111656 has 64 divisors (see below), whose sum is σ = 436483302467520. Its totient is φ = 49566074688000.
The previous prime is 161606056111637. The next prime is 161606056111663. The reversal of 161606056111656 is 656111650606161.
It is a super-2 number, since 2×1616060561116562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 161606056111599 and 161606056111608.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 827327470 + ... + 827522781.
It is an arithmetic number, because the mean of its divisors is an integer number (6820051601055).
Almost surely, 2161606056111656 is an apocalyptic number.
It is an amenable number.
161606056111656 is an abundant number, since it is smaller than the sum of its proper divisors (274877246355864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161606056111656 is a wasteful number, since it uses less digits than its factorization.
161606056111656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1654850586 (or 1654850582 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 51.
The spelling of 161606056111656 in words is "one hundred sixty-one trillion, six hundred six billion, fifty-six million, one hundred eleven thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •