Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0100000001111001000111 |
3 | 1110022011001002111002121112 |
4 | 2201201223210001321013 |
5 | 2423330300011144121 |
6 | 35335134124435235 |
7 | 2223643231046162 |
oct | 241415344017107 |
9 | 43264032432545 |
10 | 11100000099911 |
11 | 359a535753088 |
12 | 12b33076a8b1b |
13 | 626957c6a0c8 |
14 | 2a5358620ad9 |
15 | 143b0a91375b |
hex | a186b901e47 |
11100000099911 has 2 divisors, whose sum is σ = 11100000099912. Its totient is φ = 11100000099910.
The previous prime is 11100000099893. The next prime is 11100000099913. The reversal of 11100000099911 is 11999000000111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11100000099911 - 218 = 11099999837767 is a prime.
Together with 11100000099913, it forms a pair of twin primes.
It is a Chen prime.
It is a zygodrome in base 10.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100000099913) 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, 5550000049955 + 5550000049956.
It is an arithmetic number, because the mean of its divisors is an integer number (5550000049956).
Almost surely, 211100000099911 is an apocalyptic number.
11100000099911 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100000099911 is an equidigital number, since it uses as much as digits as its factorization.
11100000099911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 11100000099911 in words is "eleven trillion, one hundred billion, ninety-nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •