Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …1100000100101001011111 |
3 | 1120212210212112021200001020 |
4 | 2300033111330010221133 |
5 | 3041412014114231421 |
6 | 41431432525415223 |
7 | 2356666254212445 |
oct | 260172574045137 |
9 | 46783775250036 |
10 | 12111102102111 |
11 | 394a320445601 |
12 | 143726770a513 |
13 | 69b0c23251cc |
14 | 2dc2752cab95 |
15 | 160086b66dc6 |
hex | b03d5f04a5f |
12111102102111 has 4 divisors (see below), whose sum is σ = 16148136136152. Its totient is φ = 8074068068072.
The previous prime is 12111102102061. The next prime is 12111102102119. The reversal of 12111102102111 is 11120120111121.
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 12111102102111 - 213 = 12111102093919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111102102119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2018517017016 + ... + 2018517017021.
It is an arithmetic number, because the mean of its divisors is an integer number (4037034034038).
Almost surely, 212111102102111 is an apocalyptic number.
12111102102111 is a deficient number, since it is larger than the sum of its proper divisors (4037034034041).
12111102102111 is an equidigital number, since it uses as much as digits as its factorization.
12111102102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4037034034040.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12111102102111 its reverse (11120120111121), we get a palindrome (23231222213232).
The spelling of 12111102102111 in words is "twelve trillion, one hundred eleven billion, one hundred two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •