Base | Representation |
---|---|
bin | 110110000101001010… |
… | …1101100101011001101 |
3 | 102002202211100012102212 |
4 | 1230022111230223031 |
5 | 3400322204432130 |
6 | 125204115200205 |
7 | 11250666055301 |
oct | 1541225545315 |
9 | 362684305385 |
10 | 116137577165 |
11 | 452876a8735 |
12 | 1a6122a6065 |
13 | ac4ac3527c |
14 | 589a3a5d01 |
15 | 304ad58e95 |
hex | 1b0a56cacd |
116137577165 has 4 divisors (see below), whose sum is σ = 139365092604. Its totient is φ = 92910061728.
The previous prime is 116137577137. The next prime is 116137577183. The reversal of 116137577165 is 561775731611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 561775731611 = 19 ⋅29567143769.
It can be written as a sum of positive squares in 2 ways, for example, as 27935111044 + 88202466121 = 167138^2 + 296989^2 .
It is a cyclic number.
It is not a de Polignac number, because 116137577165 - 228 = 115869141709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11613757712 + ... + 11613757721.
It is an arithmetic number, because the mean of its divisors is an integer number (34841273151).
Almost surely, 2116137577165 is an apocalyptic number.
It is an amenable number.
116137577165 is a deficient number, since it is larger than the sum of its proper divisors (23227515439).
116137577165 is an equidigital number, since it uses as much as digits as its factorization.
116137577165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23227515438.
The product of its digits is 926100, while the sum is 50.
The spelling of 116137577165 in words is "one hundred sixteen billion, one hundred thirty-seven million, five hundred seventy-seven thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •