Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …1110000010001000001111 |
3 | 1120112020202100111011022111 |
4 | 2232302031132002020033 |
5 | 3033242214104120421 |
6 | 41313454000524451 |
7 | 2346526206433045 |
oct | 256621536021017 |
9 | 46466670434274 |
10 | 12011102020111 |
11 | 3910974a63937 |
12 | 141b9b9920727 |
13 | 6918467b735c |
14 | 2d74aa248395 |
15 | 15c682912ee1 |
hex | aec8d78220f |
12011102020111 has 4 divisors (see below), whose sum is σ = 12087605854792. Its totient is φ = 11934598185432.
The previous prime is 12011102020081. The next prime is 12011102020117. The reversal of 12011102020111 is 11102020111021.
It is a happy number.
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 12011102020111 - 235 = 11976742281743 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12011102020091 and 12011102020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011102020117) 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, 38251917105 + ... + 38251917418.
It is an arithmetic number, because the mean of its divisors is an integer number (3021901463698).
Almost surely, 212011102020111 is an apocalyptic number.
12011102020111 is a deficient number, since it is larger than the sum of its proper divisors (76503834681).
12011102020111 is an equidigital number, since it uses as much as digits as its factorization.
12011102020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76503834680.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12011102020111 its reverse (11102020111021), we get a palindrome (23113122131132).
The spelling of 12011102020111 in words is "twelve trillion, eleven billion, one hundred two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •