Base | Representation |
---|---|
bin | 1010000111010001010001… |
… | …0100010100111001000101 |
3 | 1110101001200200220102020002 |
4 | 2201310110110110321011 |
5 | 2424142240331431432 |
6 | 35352243532051045 |
7 | 2225252146443056 |
oct | 241642424247105 |
9 | 43331620812202 |
10 | 11120011202117 |
11 | 35a7a74475384 |
12 | 12b7171303a85 |
13 | 6287c6a3119c |
14 | 2a62d619672d |
15 | 1443cc623e62 |
hex | a1d14514e45 |
11120011202117 has 2 divisors, whose sum is σ = 11120011202118. Its totient is φ = 11120011202116.
The previous prime is 11120011202093. The next prime is 11120011202161. The reversal of 11120011202117 is 71120211002111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6622752987841 + 4497258214276 = 2573471^2 + 2120674^2 .
It is an emirp because it is prime and its reverse (71120211002111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11120011202117 - 220 = 11120010153541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120011204117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560005601058 + 5560005601059.
It is an arithmetic number, because the mean of its divisors is an integer number (5560005601059).
Almost surely, 211120011202117 is an apocalyptic number.
It is an amenable number.
11120011202117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120011202117 is an equidigital number, since it uses as much as digits as its factorization.
11120011202117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 11120011202117 its reverse (71120211002111), we get a palindrome (82240222204228).
The spelling of 11120011202117 in words is "eleven trillion, one hundred twenty billion, eleven million, two hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •