Base | Representation |
---|---|
bin | 10000000000011101111… |
… | …000111110000010000111 |
3 | 10220011022210201101012001 |
4 | 100000131320332002013 |
5 | 121010311323214231 |
6 | 2201201122210131 |
7 | 142321231041304 |
oct | 20003570760207 |
9 | 3804283641161 |
10 | 1100013101191 |
11 | 39457079a124 |
12 | 1592341b3947 |
13 | 7c966714564 |
14 | 3b3531180ab |
15 | 1d931bdcb61 |
hex | 1001de3e087 |
1100013101191 has 2 divisors, whose sum is σ = 1100013101192. Its totient is φ = 1100013101190.
The previous prime is 1100013101189. The next prime is 1100013101237. The reversal of 1100013101191 is 1911013100011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100013101191 - 21 = 1100013101189 is a prime.
Together with 1100013101189, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100013101141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550006550595 + 550006550596.
It is an arithmetic number, because the mean of its divisors is an integer number (550006550596).
Almost surely, 21100013101191 is an apocalyptic number.
1100013101191 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100013101191 is an equidigital number, since it uses as much as digits as its factorization.
1100013101191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 19.
The spelling of 1100013101191 in words is "one trillion, one hundred billion, thirteen million, one hundred one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •