Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00011100011111101 |
3 | 1001101121122000221111 |
4 | 22033222003203331 |
5 | 140012011213432 |
6 | 5015310202021 |
7 | 536410213435 |
oct | 121752034375 |
9 | 31347560844 |
10 | 11000101117 |
11 | 47352a7865 |
12 | 216bab3311 |
13 | 1063c61695 |
14 | 764cd92c5 |
15 | 445aae347 |
hex | 28fa838fd |
11000101117 has 2 divisors, whose sum is σ = 11000101118. Its totient is φ = 11000101116.
The previous prime is 11000101087. The next prime is 11000101121. The reversal of 11000101117 is 71110100011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10883914276 + 116186841 = 104326^2 + 10779^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000101117 - 231 = 8852617469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000101097 and 11000101106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000101127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500050558 + 5500050559.
It is an arithmetic number, because the mean of its divisors is an integer number (5500050559).
Almost surely, 211000101117 is an apocalyptic number.
It is an amenable number.
11000101117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000101117 is an equidigital number, since it uses as much as digits as its factorization.
11000101117 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 13.
Adding to 11000101117 its reverse (71110100011), we get a palindrome (82110201128).
The spelling of 11000101117 in words is "eleven billion, one hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •