Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …1001011101110000101111 |
3 | 1110101011210101122101000022 |
4 | 2201311123321131300233 |
5 | 2424202220300320421 |
6 | 35353003031552355 |
7 | 2225324001203522 |
oct | 241653371356057 |
9 | 43334711571008 |
10 | 11121212120111 |
11 | 35a8530348895 |
12 | 12b744752b6bb |
13 | 628958787452 |
14 | 2a63ab884bb9 |
15 | 14444cc917ab |
hex | a1d5be5dc2f |
11121212120111 has 4 divisors (see below), whose sum is σ = 11128132602192. Its totient is φ = 11114291638032.
The previous prime is 11121212120101. The next prime is 11121212120189. The reversal of 11121212120111 is 11102121212111.
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 11121212120111 - 242 = 6723165609007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11121212120111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121212120101) 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, 3460238630 + ... + 3460241843.
It is an arithmetic number, because the mean of its divisors is an integer number (2782033150548).
Almost surely, 211121212120111 is an apocalyptic number.
11121212120111 is a deficient number, since it is larger than the sum of its proper divisors (6920482081).
11121212120111 is an equidigital number, since it uses as much as digits as its factorization.
11121212120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6920482080.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11121212120111 its reverse (11102121212111), we get a palindrome (22223333332222).
The spelling of 11121212120111 in words is "eleven trillion, one hundred twenty-one billion, two hundred twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •