Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0011001101010100001111 |
3 | 1102222122121012002011000201 |
4 | 2200032321103031110033 |
5 | 2420401223124444022 |
6 | 35230233433234331 |
7 | 2214345366500464 |
oct | 240167123152417 |
9 | 42878535064021 |
10 | 11011109999887 |
11 | 35658705992a8 |
12 | 129a03a5629a7 |
13 | 61b46008399a |
14 | 2a0d24cbb66b |
15 | 141656c26127 |
hex | a03b94cd50f |
11011109999887 has 2 divisors, whose sum is σ = 11011109999888. Its totient is φ = 11011109999886.
The previous prime is 11011109999789. The next prime is 11011109999957. The reversal of 11011109999887 is 78899990111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011109999887 - 227 = 11010975782159 is a prime.
It is a super-2 number, since 2×110111099998872 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011109999987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505554999943 + 5505554999944.
It is an arithmetic number, because the mean of its divisors is an integer number (5505554999944).
Almost surely, 211011109999887 is an apocalyptic number.
11011109999887 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011109999887 is an equidigital number, since it uses as much as digits as its factorization.
11011109999887 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2939328, while the sum is 64.
The spelling of 11011109999887 in words is "eleven trillion, eleven billion, one hundred nine million, nine hundred ninety-nine thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.496 sec. • engine limits •