Base | Representation |
---|---|
bin | 100100110000011001111100… |
… | …000110000111110101101001 |
3 | 210012101011112211202210011020 |
4 | 210300121330012013311221 |
5 | 132142033103113112401 |
6 | 1331451434053123053 |
7 | 46023156615114633 |
oct | 4460317406076551 |
9 | 705334484683136 |
10 | 161656061066601 |
11 | 47565a5011a872 |
12 | 1616a03b929489 |
13 | 6c281412b750a |
14 | 2bcc2a350da53 |
15 | 13a50a2497d36 |
hex | 93067c187d69 |
161656061066601 has 8 divisors (see below), whose sum is σ = 215548788599424. Its totient is φ = 107767020455760.
The previous prime is 161656061066587. The next prime is 161656061066663. The reversal of 161656061066601 is 106660160656161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161656061066601 - 27 = 161656061066473 is a prime.
It is a super-2 number, since 2×1616560610666012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (161656061066681) by changing a digit.
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, 921628186 + ... + 921803571.
It is an arithmetic number, because the mean of its divisors is an integer number (26943598574928).
Almost surely, 2161656061066601 is an apocalyptic number.
It is an amenable number.
161656061066601 is a deficient number, since it is larger than the sum of its proper divisors (53892727532823).
161656061066601 is a wasteful number, since it uses less digits than its factorization.
161656061066601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1843460991.
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 161656061066601 in words is "one hundred sixty-one trillion, six hundred fifty-six billion, sixty-one million, sixty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •