Base | Representation |
---|---|
bin | 1010000111010001101000… |
… | …0101101001100000110101 |
3 | 1110101001221110002011021001 |
4 | 2201310122011221200311 |
5 | 2424142440123031332 |
6 | 35352301311123301 |
7 | 2225254433403226 |
oct | 241643205514065 |
9 | 43331843064231 |
10 | 11120108017717 |
11 | 35a8014091376 |
12 | 12b7199813531 |
13 | 628810acb41a |
14 | 2a6304d9924d |
15 | 1443d5d9a0e7 |
hex | a1d1a169835 |
11120108017717 has 2 divisors, whose sum is σ = 11120108017718. Its totient is φ = 11120108017716.
The previous prime is 11120108017679. The next prime is 11120108017721. The reversal of 11120108017717 is 71771080102111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10741783381156 + 378324636561 = 3277466^2 + 615081^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120108017717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120108717717) by changing a digit.
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 as a sum of consecutive naturals, namely, 5560054008858 + 5560054008859.
It is an arithmetic number, because the mean of its divisors is an integer number (5560054008859).
Almost surely, 211120108017717 is an apocalyptic number.
It is an amenable number.
11120108017717 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120108017717 is an equidigital number, since it uses as much as digits as its factorization.
11120108017717 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5488, while the sum is 37.
Adding to 11120108017717 its reverse (71771080102111), we get a palindrome (82891188119828).
The spelling of 11120108017717 in words is "eleven trillion, one hundred twenty billion, one hundred eight million, seventeen thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •