Base | Representation |
---|---|
bin | 110011010011000011… |
… | …1000101001100110001 |
3 | 101112100022110111102220 |
4 | 1212212013011030301 |
5 | 3301102212302221 |
6 | 122335101431253 |
7 | 10646615350053 |
oct | 1464607051461 |
9 | 345308414386 |
10 | 110161056561 |
11 | 427a0054306 |
12 | 1942486b529 |
13 | a50799a54a |
14 | 54907498d3 |
15 | 2ceb30d0c6 |
hex | 19a61c5331 |
110161056561 has 16 divisors (see below), whose sum is σ = 150865951104. Its totient is φ = 71448822144.
The previous prime is 110161056559. The next prime is 110161056581. The reversal of 110161056561 is 165650161011.
It is not a de Polignac number, because 110161056561 - 21 = 110161056559 is a prime.
It is a super-2 number, since 2×1101610565612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110161056541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1244020 + ... + 1329626.
It is an arithmetic number, because the mean of its divisors is an integer number (9429121944).
Almost surely, 2110161056561 is an apocalyptic number.
It is an amenable number.
110161056561 is a deficient number, since it is larger than the sum of its proper divisors (40704894543).
110161056561 is a wasteful number, since it uses less digits than its factorization.
110161056561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97240.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 110161056561 in words is "one hundred ten billion, one hundred sixty-one million, fifty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •