Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1011010000111100101111 |
3 | 1110022100111211200021121012 |
4 | 2201203221323100330233 |
5 | 2423344120222320421 |
6 | 35340124340055435 |
7 | 2224046612655116 |
oct | 241435173207457 |
9 | 43270454607535 |
10 | 11102120120111 |
11 | 35a0423415699 |
12 | 12b37b969457b |
13 | 626c05247627 |
14 | 2a54b9ddcc7d |
15 | 143bd1ad295b |
hex | a18e9ed0f2f |
11102120120111 has 4 divisors (see below), whose sum is σ = 11102343368424. Its totient is φ = 11101896871800.
The previous prime is 11102120120099. The next prime is 11102120120159. The reversal of 11102120120111 is 11102102120111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11102120120111 - 210 = 11102120119087 is a prime.
It is a super-2 number, since 2×111021201201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102120120011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111549545 + ... + 111649026.
It is an arithmetic number, because the mean of its divisors is an integer number (2775585842106).
Almost surely, 211102120120111 is an apocalyptic number.
11102120120111 is a deficient number, since it is larger than the sum of its proper divisors (223248313).
11102120120111 is an equidigital number, since it uses as much as digits as its factorization.
11102120120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223248312.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11102120120111 its reverse (11102102120111), we get a palindrome (22204222240222).
The spelling of 11102120120111 in words is "eleven trillion, one hundred two billion, one hundred twenty million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •