Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …010001101000111011101 |
3 | 10221010101120002120000222 |
4 | 100021313302031013131 |
5 | 121142001432240442 |
6 | 2205551131531125 |
7 | 143126406416504 |
oct | 20116762150735 |
9 | 3833346076028 |
10 | 1110111211997 |
11 | 398882925247 |
12 | 15b191bb9aa5 |
13 | 808b5833658 |
14 | 3ba302d983b |
15 | 1dd234ca8d2 |
hex | 10277c8d1dd |
1110111211997 has 2 divisors, whose sum is σ = 1110111211998. Its totient is φ = 1110111211996.
The previous prime is 1110111211991. The next prime is 1110111212039. The reversal of 1110111211997 is 7991121110111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 728204515801 + 381906696196 = 853349^2 + 617986^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110111211997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110111211991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555055605998 + 555055605999.
It is an arithmetic number, because the mean of its divisors is an integer number (555055605999).
Almost surely, 21110111211997 is an apocalyptic number.
It is an amenable number.
1110111211997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110111211997 is an equidigital number, since it uses as much as digits as its factorization.
1110111211997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 35.
The spelling of 1110111211997 in words is "one trillion, one hundred ten billion, one hundred eleven million, two hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •