Base | Representation |
---|---|
bin | 100100100111000000011001… |
… | …001100010111110100110001 |
3 | 210010002102100122200120102202 |
4 | 210213000121030113310301 |
5 | 132100442300101304121 |
6 | 1330235013404152545 |
7 | 45625412531234435 |
oct | 4447003114276461 |
9 | 703072318616382 |
10 | 161010156666161 |
11 | 47337029a03850 |
12 | 16084a1b838755 |
13 | 6bac2672715aa |
14 | 2ba8d0c8569c5 |
15 | 139339c5e140b |
hex | 927019317d31 |
161010156666161 has 8 divisors (see below), whose sum is σ = 175652509003200. Its totient is φ = 146368648557040.
The previous prime is 161010156666143. The next prime is 161010156666167. The reversal of 161010156666161 is 161666651010161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161010156666161 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (161010156666167) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 210658166 + ... + 211421103.
It is an arithmetic number, because the mean of its divisors is an integer number (21956563625400).
Almost surely, 2161010156666161 is an apocalyptic number.
161010156666161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
161010156666161 is a deficient number, since it is larger than the sum of its proper divisors (14642352337039).
161010156666161 is a wasteful number, since it uses less digits than its factorization.
161010156666161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422113959.
The product of its (nonzero) digits is 233280, while the sum is 47.
The spelling of 161010156666161 in words is "one hundred sixty-one trillion, ten billion, one hundred fifty-six million, six hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •