Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0000101001111100010011 |
3 | 1102221200210021112002220112 |
4 | 2200011211100221330103 |
5 | 2420220233142004341 |
6 | 35221501253031535 |
7 | 2213542523024462 |
oct | 240054520517423 |
9 | 42850707462815 |
10 | 11001110109971 |
11 | 35615a9949a73 |
12 | 12981096255ab |
13 | 61a528404667 |
14 | 2a0656b869d9 |
15 | 14126dd8aaeb |
hex | a0165429f13 |
11001110109971 has 2 divisors, whose sum is σ = 11001110109972. Its totient is φ = 11001110109970.
The previous prime is 11001110109947. The next prime is 11001110110009. The reversal of 11001110109971 is 17990101110011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11001110109971 - 214 = 11001110093587 is a prime.
It is a super-2 number, since 2×110011101099712 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11001110109901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500555054985 + 5500555054986.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555054986).
Almost surely, 211001110109971 is an apocalyptic number.
11001110109971 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001110109971 is an equidigital number, since it uses as much as digits as its factorization.
11001110109971 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 32.
Adding to 11001110109971 its reverse (17990101110011), we get a palindrome (28991211219982).
The spelling of 11001110109971 in words is "eleven trillion, one billion, one hundred ten million, one hundred nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •