Base | Representation |
---|---|
bin | 11001000000110111110101… |
… | …001100011001101000110111 |
3 | 112102111221220110220010200111 |
4 | 121000313311030121220313 |
5 | 103404410223410133421 |
6 | 1025550223503323451 |
7 | 32113016612606236 |
oct | 3100676514315067 |
9 | 472457813803614 |
10 | 110011111021111 |
11 | 320644a5207873 |
12 | 10408a825b0587 |
13 | 49500071cab71 |
14 | 1d247cd870b1d |
15 | cab994dd1ee1 |
hex | 640df5319a37 |
110011111021111 has 2 divisors, whose sum is σ = 110011111021112. Its totient is φ = 110011111021110.
The previous prime is 110011111021099. The next prime is 110011111021151. The reversal of 110011111021111 is 111120111110011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110011111021111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011111021091 and 110011111021100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110011111021151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005555510555 + 55005555510556.
It is an arithmetic number, because the mean of its divisors is an integer number (55005555510556).
Almost surely, 2110011111021111 is an apocalyptic number.
110011111021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011111021111 is an equidigital number, since it uses as much as digits as its factorization.
110011111021111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 110011111021111 its reverse (111120111110011), we get a palindrome (221131222131122).
The spelling of 110011111021111 in words is "one hundred ten trillion, eleven billion, one hundred eleven million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •