Base | Representation |
---|---|
bin | 1010000111000011001100… |
… | …1101000001100001100001 |
3 | 1110100200221111012201011021 |
4 | 2201300303031001201201 |
5 | 2424112022002223202 |
6 | 35350421054245441 |
7 | 2225056436331364 |
oct | 241606315014141 |
9 | 43320844181137 |
10 | 11116234414177 |
11 | 35a6406588732 |
12 | 12b64984b6881 |
13 | 628344433219 |
14 | 2a60587480db |
15 | 14425ac90a37 |
hex | a1c33341861 |
11116234414177 has 2 divisors, whose sum is σ = 11116234414178. Its totient is φ = 11116234414176.
The previous prime is 11116234414147. The next prime is 11116234414183. The reversal of 11116234414177 is 77141443261111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10965429565281 + 150804848896 = 3311409^2 + 388336^2 .
It is a cyclic number.
It is not a de Polignac number, because 11116234414177 - 243 = 2320141391969 is a prime.
It is not a weakly prime, because it can be changed into another prime (11116234414147) 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 as a sum of consecutive naturals, namely, 5558117207088 + 5558117207089.
It is an arithmetic number, because the mean of its divisors is an integer number (5558117207089).
Almost surely, 211116234414177 is an apocalyptic number.
It is an amenable number.
11116234414177 is a deficient number, since it is larger than the sum of its proper divisors (1).
11116234414177 is an equidigital number, since it uses as much as digits as its factorization.
11116234414177 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 112896, while the sum is 43.
Adding to 11116234414177 its reverse (77141443261111), we get a palindrome (88257677675288).
The spelling of 11116234414177 in words is "eleven trillion, one hundred sixteen billion, two hundred thirty-four million, four hundred fourteen thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •