Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …100011010000100000000101 |
3 | 210012012101121101210100012120 |
4 | 210233223122203100200011 |
5 | 132140223301133430023 |
6 | 1331412453102040153 |
7 | 46016440651302162 |
oct | 4457533243204005 |
9 | 705171541710176 |
10 | 161606106155013 |
11 | 47546845953373 |
12 | 16160419b79059 |
13 | 6c2350c9a3430 |
14 | 2bc9ac4b99069 |
15 | 13a3b2ba5c8e3 |
hex | 92fada8d0805 |
161606106155013 has 32 divisors (see below), whose sum is σ = 232736298762240. Its totient is φ = 99156055761600.
The previous prime is 161606106154943. The next prime is 161606106155047. The reversal of 161606106155013 is 310551601606161.
It is a happy number.
It is not a de Polignac number, because 161606106155013 - 214 = 161606106138629 is a prime.
It is a super-2 number, since 2×1616061061550132 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161606106154013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17743870 + ... + 25259792.
It is an arithmetic number, because the mean of its divisors is an integer number (7273009336320).
Almost surely, 2161606106155013 is an apocalyptic number.
161606106155013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
161606106155013 is a deficient number, since it is larger than the sum of its proper divisors (71130192607227).
161606106155013 is a wasteful number, since it uses less digits than its factorization.
161606106155013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7517569.
The product of its (nonzero) digits is 97200, while the sum is 42.
The spelling of 161606106155013 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred six million, one hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •