Base | Representation |
---|---|
bin | 11001001111010010110001… |
… | …010101100100110111110111 |
3 | 112120000200211220100101102011 |
4 | 121033102301111210313313 |
5 | 104022124310131133421 |
6 | 1032025355415225051 |
7 | 32244431523250621 |
oct | 3117226125446767 |
9 | 476020756311364 |
10 | 111002110021111 |
11 | 32406804319191 |
12 | 10548b52078187 |
13 | 49c25b97561aa |
14 | 1d5a7606c1c11 |
15 | cc76463204e1 |
hex | 64f4b1564df7 |
111002110021111 has 2 divisors, whose sum is σ = 111002110021112. Its totient is φ = 111002110021110.
The previous prime is 111002110021091. The next prime is 111002110021123. The reversal of 111002110021111 is 111120011200111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111002110021111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111002110021091 and 111002110021100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111002110021211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55501055010555 + 55501055010556.
It is an arithmetic number, because the mean of its divisors is an integer number (55501055010556).
Almost surely, 2111002110021111 is an apocalyptic number.
111002110021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
111002110021111 is an equidigital number, since it uses as much as digits as its factorization.
111002110021111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111002110021111 its reverse (111120011200111), we get a palindrome (222122121221222).
The spelling of 111002110021111 in words is "one hundred eleven trillion, two billion, one hundred ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •