Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101001010110101011011 |
3 | 1110100012201102210220000221 |
4 | 2201230001311022311123 |
5 | 2424021023421004404 |
6 | 35344212440140511 |
7 | 2224515456061426 |
oct | 241540165126533 |
9 | 43305642726027 |
10 | 11111111109979 |
11 | 35a4217612431 |
12 | 12b54a8767737 |
13 | 627a08b9178a |
14 | 2a5ad014a9bd |
15 | 14405b0ce954 |
hex | a1b01d4ad5b |
11111111109979 has 2 divisors, whose sum is σ = 11111111109980. Its totient is φ = 11111111109978.
The previous prime is 11111111109949. The next prime is 11111111110031. The reversal of 11111111109979 is 97990111111111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11111111109979 - 213 = 11111111101787 is a prime.
It is a super-3 number, since 3×111111111099793 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11111111109929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555555554989 + 5555555554990.
It is an arithmetic number, because the mean of its divisors is an integer number (5555555554990).
Almost surely, 211111111109979 is an apocalyptic number.
11111111109979 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111111109979 is an equidigital number, since it uses as much as digits as its factorization.
11111111109979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 43.
The spelling of 11111111109979 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred nine thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •