Base | Representation |
---|---|
bin | 100110001011000000111… |
… | …001111011010011101001 |
3 | 100021202211222111001211100 |
4 | 212023000321323103221 |
5 | 320434221103224121 |
6 | 5325022132552013 |
7 | 360342340012131 |
oct | 46130071732351 |
9 | 10252758431740 |
10 | 2623166461161 |
11 | 92152a099554 |
12 | 364479182609 |
13 | 1604958c435c |
14 | 90d67793ac1 |
15 | 4837ba8c026 |
hex | 262c0e7b4e9 |
2623166461161 has 6 divisors (see below), whose sum is σ = 3789018221690. Its totient is φ = 1748777640768.
The previous prime is 2623166461151. The next prime is 2623166461217. The reversal of 2623166461161 is 1611646613262.
2623166461161 is a `hidden beast` number, since 2 + 6 + 23 + 1 + 6 + 6 + 4 + 611 + 6 + 1 = 666.
2623166461161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2521759880025 + 101406581136 = 1588005^2 + 318444^2 .
It is not a de Polignac number, because 2623166461161 - 211 = 2623166459113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2623166461141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 145731470056 + ... + 145731470073.
Almost surely, 22623166461161 is an apocalyptic number.
It is an amenable number.
2623166461161 is a deficient number, since it is larger than the sum of its proper divisors (1165851760529).
2623166461161 is a wasteful number, since it uses less digits than its factorization.
2623166461161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291462940135 (or 291462940132 counting only the distinct ones).
The product of its digits is 373248, while the sum is 45.
The spelling of 2623166461161 in words is "two trillion, six hundred twenty-three billion, one hundred sixty-six million, four hundred sixty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •