Base | Representation |
---|---|
bin | 11001000010011111001100… |
… | …110001011000110111010111 |
3 | 112102220120101122000010001112 |
4 | 121002133030301120313113 |
5 | 103413220031103013421 |
6 | 1030113221213245235 |
7 | 32124026226432224 |
oct | 3102371461306727 |
9 | 472816348003045 |
10 | 110122102001111 |
11 | 320a758077a912 |
12 | 1042649919381b |
13 | 495a614ac7465 |
14 | 1d29d1c4d494b |
15 | cae7ddec845b |
hex | 6427ccc58dd7 |
110122102001111 has 2 divisors, whose sum is σ = 110122102001112. Its totient is φ = 110122102001110.
The previous prime is 110122102001027. The next prime is 110122102001113. The reversal of 110122102001111 is 111100201221011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110122102001111 - 210 = 110122102000087 is a prime.
It is a Sophie Germain prime.
Together with 110122102001113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110122102001113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55061051000555 + 55061051000556.
It is an arithmetic number, because the mean of its divisors is an integer number (55061051000556).
Almost surely, 2110122102001111 is an apocalyptic number.
110122102001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110122102001111 is an equidigital number, since it uses as much as digits as its factorization.
110122102001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110122102001111 its reverse (111100201221011), we get a palindrome (221222303222122).
The spelling of 110122102001111 in words is "one hundred ten trillion, one hundred twenty-two billion, one hundred two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •