Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0100010110011001100011 |
3 | 1110022020122112200201011022 |
4 | 2201202213310112121203 |
5 | 2423334332304324141 |
6 | 35335422320040055 |
7 | 2224010254463264 |
oct | 241424764263143 |
9 | 43266575621138 |
10 | 11101011011171 |
11 | 359aa04349734 |
12 | 12b354a16302b |
13 | 626a89527853 |
14 | 2a54129ac96b |
15 | 143b6954cb4b |
hex | a18a7d16663 |
11101011011171 has 2 divisors, whose sum is σ = 11101011011172. Its totient is φ = 11101011011170.
The previous prime is 11101011011149. The next prime is 11101011011179. The reversal of 11101011011171 is 17111011010111.
It is a strong prime.
It is an emirp because it is prime and its reverse (17111011010111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101011011171 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11101011011179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505505585 + 5550505505586.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505505586).
Almost surely, 211101011011171 is an apocalyptic number.
11101011011171 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101011011171 is an equidigital number, since it uses as much as digits as its factorization.
11101011011171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 17.
Adding to 11101011011171 its reverse (17111011010111), we get a palindrome (28212022021282).
The spelling of 11101011011171 in words is "eleven trillion, one hundred one billion, eleven million, eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •