Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …1111110000110010111101 |
3 | 1110100012201122000222021012 |
4 | 2201230001333300302331 |
5 | 2424021030123340114 |
6 | 35344213015445005 |
7 | 2224515521505431 |
oct | 241540177606275 |
9 | 43305648028235 |
10 | 11111113886909 |
11 | 35a4219139813 |
12 | 12b54a9686765 |
13 | 627a0962472a |
14 | 2a5ad06709c1 |
15 | 14405b47c63e |
hex | a1b01ff0cbd |
11111113886909 has 2 divisors, whose sum is σ = 11111113886910. Its totient is φ = 11111113886908.
The previous prime is 11111113886849. The next prime is 11111113886911. The reversal of 11111113886909 is 90968831111111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7768049042884 + 3343064844025 = 2787122^2 + 1828405^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111113886909 - 220 = 11111112838333 is a prime.
Together with 11111113886911, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111113886209) 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, 5555556943454 + 5555556943455.
It is an arithmetic number, because the mean of its divisors is an integer number (5555556943455).
Almost surely, 211111113886909 is an apocalyptic number.
It is an amenable number.
11111113886909 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111113886909 is an equidigital number, since it uses as much as digits as its factorization.
11111113886909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 50.
The spelling of 11111113886909 in words is "eleven trillion, one hundred eleven billion, one hundred thirteen million, eight hundred eighty-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •