Base | Representation |
---|---|
bin | 100110101110010000101… |
… | …000101110101001100001 |
3 | 100102101112110022201112222 |
4 | 212232100220232221201 |
5 | 322044222401232121 |
6 | 5354241324200425 |
7 | 363152225202251 |
oct | 46562050565141 |
9 | 10371473281488 |
10 | 2661011352161 |
11 | 93658a599278 |
12 | 36b87b399115 |
13 | 163c17332096 |
14 | 92b17a4b961 |
15 | 493442730ab |
hex | 26b90a2ea61 |
2661011352161 has 8 divisors (see below), whose sum is σ = 2673287644800. Its totient is φ = 2648740765680.
The previous prime is 2661011352149. The next prime is 2661011352191. The reversal of 2661011352161 is 1612531101662.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2661011352161 - 234 = 2643831482977 is a prime.
It is a super-3 number, since 3×26610113521613 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2661011352101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 490295 + ... + 2358476.
It is an arithmetic number, because the mean of its divisors is an integer number (334160955600).
Almost surely, 22661011352161 is an apocalyptic number.
It is an amenable number.
2661011352161 is a deficient number, since it is larger than the sum of its proper divisors (12276292639).
2661011352161 is a wasteful number, since it uses less digits than its factorization.
2661011352161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2853079.
The product of its (nonzero) digits is 12960, while the sum is 35.
The spelling of 2661011352161 in words is "two trillion, six hundred sixty-one billion, eleven million, three hundred fifty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •