Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101011100100111111101 |
3 | 1102222122120111110020110121 |
4 | 2200032320231130213331 |
5 | 2420401213111213432 |
6 | 35230232441134541 |
7 | 2214345216402214 |
oct | 240167055344775 |
9 | 42878514406417 |
10 | 11011100101117 |
11 | 3565865a481a6 |
12 | 129a03718a451 |
13 | 61b45acc921c |
14 | 2a0d2386207b |
15 | 141655e1d197 |
hex | a03b8b5c9fd |
11011100101117 has 2 divisors, whose sum is σ = 11011100101118. Its totient is φ = 11011100101116.
The previous prime is 11011100101091. The next prime is 11011100101159. The reversal of 11011100101117 is 71110100111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11001619963161 + 9480137956 = 3316869^2 + 97366^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011100101117 - 215 = 11011100068349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011100101117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011100101717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505550050558 + 5505550050559.
It is an arithmetic number, because the mean of its divisors is an integer number (5505550050559).
Almost surely, 211011100101117 is an apocalyptic number.
It is an amenable number.
11011100101117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011100101117 is an equidigital number, since it uses as much as digits as its factorization.
11011100101117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 16.
Adding to 11011100101117 its reverse (71110100111011), we get a palindrome (82121200212128).
The spelling of 11011100101117 in words is "eleven trillion, eleven billion, one hundred million, one hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •