Base | Representation |
---|---|
bin | 1011000000010111110001… |
… | …1010100100000100100111 |
3 | 1120211211211012121111011111 |
4 | 2300011330122210010213 |
5 | 3041230332103223421 |
6 | 41423043301245451 |
7 | 2356161212440633 |
oct | 260057432440447 |
9 | 46754735544144 |
10 | 12101010211111 |
11 | 3946011878518 |
12 | 143530ba03887 |
13 | 69a1745a3183 |
14 | 2db998c87dc3 |
15 | 15eb95ba6ee1 |
hex | b017c6a4127 |
12101010211111 has 16 divisors (see below), whose sum is σ = 12756330367200. Its totient is φ = 11447538081408.
The previous prime is 12101010211049. The next prime is 12101010211153. The reversal of 12101010211111 is 11111201010121.
It is a cyclic number.
It is not a de Polignac number, because 12101010211111 - 27 = 12101010210983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12101010211091 and 12101010211100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101010215111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81895245 + ... + 82042873.
It is an arithmetic number, because the mean of its divisors is an integer number (797270647950).
Almost surely, 212101010211111 is an apocalyptic number.
12101010211111 is a deficient number, since it is larger than the sum of its proper divisors (655320156089).
12101010211111 is a wasteful number, since it uses less digits than its factorization.
12101010211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153858.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 12101010211111 its reverse (11111201010121), we get a palindrome (23212211221232).
The spelling of 12101010211111 in words is "twelve trillion, one hundred one billion, ten million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •