Base | Representation |
---|---|
bin | 1011000000111101000100… |
… | …0010111101100101011011 |
3 | 1120212210122210211120110002 |
4 | 2300033101002331211123 |
5 | 3041411332111201412 |
6 | 41431420434243215 |
7 | 2356664236434236 |
oct | 260172102754533 |
9 | 46783583746402 |
10 | 12111020022107 |
11 | 394a289083696 |
12 | 143724412650b |
13 | 69b0ab317166 |
14 | 2dc26844241d |
15 | 16007e851dc2 |
hex | b03d10bd95b |
12111020022107 has 2 divisors, whose sum is σ = 12111020022108. Its totient is φ = 12111020022106.
The previous prime is 12111020022071. The next prime is 12111020022139. The reversal of 12111020022107 is 70122002011121.
It is a happy number.
12111020022107 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (12111020022071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12111020022107 - 220 = 12111018973531 is a prime.
It is not a weakly prime, because it can be changed into another prime (12111020022187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055510011053 + 6055510011054.
It is an arithmetic number, because the mean of its divisors is an integer number (6055510011054).
Almost surely, 212111020022107 is an apocalyptic number.
12111020022107 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111020022107 is an equidigital number, since it uses as much as digits as its factorization.
12111020022107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 12111020022107 its reverse (70122002011121), we get a palindrome (82233022033228).
The spelling of 12111020022107 in words is "twelve trillion, one hundred eleven billion, twenty million, twenty-two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •