Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101001000101010101011 |
3 | 1110100012201102210102212001 |
4 | 2201230001311020222223 |
5 | 2424021023420213344 |
6 | 35344212440031431 |
7 | 2224515456023512 |
oct | 241540165105253 |
9 | 43305642712761 |
10 | 11111111101099 |
11 | 35a4217606799 |
12 | 12b54a8762577 |
13 | 627a08b8a719 |
14 | 2a5ad0147679 |
15 | 14405b0cbed4 |
hex | a1b01d48aab |
11111111101099 has 2 divisors, whose sum is σ = 11111111101100. Its totient is φ = 11111111101098.
The previous prime is 11111111101003. The next prime is 11111111101127. The reversal of 11111111101099 is 99010111111111.
It is an a-pointer prime, because the next prime (11111111101127) can be obtained adding 11111111101099 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11111111101099 - 223 = 11111102712491 is a prime.
It is not a weakly prime, because it can be changed into another prime (11111111107099) 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, 5555555550549 + 5555555550550.
It is an arithmetic number, because the mean of its divisors is an integer number (5555555550550).
Almost surely, 211111111101099 is an apocalyptic number.
11111111101099 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111111101099 is an equidigital number, since it uses as much as digits as its factorization.
11111111101099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 28.
The spelling of 11111111101099 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •