Base | Representation |
---|---|
bin | 110011111011011011… |
… | …1111111101001100001 |
3 | 101122211202010121110021 |
4 | 1213312313333221201 |
5 | 3311341102244121 |
6 | 123121344033441 |
7 | 11025320560156 |
oct | 1476667775141 |
9 | 348752117407 |
10 | 111516056161 |
11 | 433259a7594 |
12 | 19742602881 |
13 | a692621463 |
14 | 557c6a622d |
15 | 2d7a264641 |
hex | 19f6dffa61 |
111516056161 has 2 divisors, whose sum is σ = 111516056162. Its totient is φ = 111516056160.
The previous prime is 111516056159. The next prime is 111516056189. The reversal of 111516056161 is 161650615111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107301449761 + 4214606400 = 327569^2 + 64920^2 .
It is an emirp because it is prime and its reverse (161650615111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111516056161 - 21 = 111516056159 is a prime.
Together with 111516056159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (111516056101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55758028080 + 55758028081.
It is an arithmetic number, because the mean of its divisors is an integer number (55758028081).
Almost surely, 2111516056161 is an apocalyptic number.
It is an amenable number.
111516056161 is a deficient number, since it is larger than the sum of its proper divisors (1).
111516056161 is an equidigital number, since it uses as much as digits as its factorization.
111516056161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 34.
The spelling of 111516056161 in words is "one hundred eleven billion, five hundred sixteen million, fifty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •