Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …0110001011100001101111 |
3 | 1110100010101000200020021102 |
4 | 2201223023212023201233 |
5 | 2424012143002222431 |
6 | 35343542253553315 |
7 | 2224454100053621 |
oct | 241531346134157 |
9 | 43303330606242 |
10 | 11110201210991 |
11 | 35a389aa398a3 |
12 | 12b5293aa583b |
13 | 6278c25104cc |
14 | 2a5a45374c11 |
15 | 144006299dcb |
hex | a1acb98b86f |
11110201210991 has 2 divisors, whose sum is σ = 11110201210992. Its totient is φ = 11110201210990.
The previous prime is 11110201210967. The next prime is 11110201211003. The reversal of 11110201210991 is 19901210201111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11110201210991 - 234 = 11093021341807 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110201210891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555100605495 + 5555100605496.
It is an arithmetic number, because the mean of its divisors is an integer number (5555100605496).
Almost surely, 211110201210991 is an apocalyptic number.
11110201210991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110201210991 is an equidigital number, since it uses as much as digits as its factorization.
11110201210991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 11110201210991 in words is "eleven trillion, one hundred ten billion, two hundred one million, two hundred ten thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •