Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1010110110010101101101 |
3 | 1110022100111211110202002101 |
4 | 2201203221322312111231 |
5 | 2423344120210323432 |
6 | 35340124333455101 |
7 | 2224046612022262 |
oct | 241435172662555 |
9 | 43270454422071 |
10 | 11102120011117 |
11 | 35a0423350813 |
12 | 12b37b9641491 |
13 | 626c05209b35 |
14 | 2a54b9db1269 |
15 | 143bd1ab04e7 |
hex | a18e9eb656d |
11102120011117 has 2 divisors, whose sum is σ = 11102120011118. Its totient is φ = 11102120011116.
The previous prime is 11102120010977. The next prime is 11102120011121. The reversal of 11102120011117 is 71111002120111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10669930788196 + 432189222921 = 3266486^2 + 657411^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102120011117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102120011094 and 11102120011103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102120011517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551060005558 + 5551060005559.
It is an arithmetic number, because the mean of its divisors is an integer number (5551060005559).
Almost surely, 211102120011117 is an apocalyptic number.
It is an amenable number.
11102120011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102120011117 is an equidigital number, since it uses as much as digits as its factorization.
11102120011117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 19.
Adding to 11102120011117 its reverse (71111002120111), we get a palindrome (82213122131228).
The spelling of 11102120011117 in words is "eleven trillion, one hundred two billion, one hundred twenty million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •