Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111000100001100000111 |
3 | 1102222122121020222112010021 |
4 | 2200032321113010030013 |
5 | 2420401223404323304 |
6 | 35230233511040011 |
7 | 2214345411211534 |
oct | 240167127041407 |
9 | 42878536875107 |
10 | 11011111011079 |
11 | 3565871119aa3 |
12 | 129a03a970007 |
13 | 61b46034901a |
14 | 2a0d250a1d8b |
15 | 141656d75a54 |
hex | a03b95c4307 |
11011111011079 has 2 divisors, whose sum is σ = 11011111011080. Its totient is φ = 11011111011078.
The previous prime is 11011111011013. The next prime is 11011111011137. The reversal of 11011111011079 is 97011011111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011111011079 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011111011179) 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, 5505555505539 + 5505555505540.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555505540).
Almost surely, 211011111011079 is an apocalyptic number.
11011111011079 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011111011079 is an equidigital number, since it uses as much as digits as its factorization.
11011111011079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 25.
The spelling of 11011111011079 in words is "eleven trillion, eleven billion, one hundred eleven million, eleven thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •