Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101100011100100011001 |
3 | 1110100012201110000001000011 |
4 | 2201230001311203210121 |
5 | 2424021023432230124 |
6 | 35344212442241521 |
7 | 2224515456662665 |
oct | 241540165434431 |
9 | 43305643001004 |
10 | 11111111211289 |
11 | 35a4217681561 |
12 | 12b54a87b62a1 |
13 | 627a08bc891b |
14 | 2a5ad01758a5 |
15 | 14405b0ee994 |
hex | a1b01d63919 |
11111111211289 has 2 divisors, whose sum is σ = 11111111211290. Its totient is φ = 11111111211288.
The previous prime is 11111111211283. The next prime is 11111111211293. The reversal of 11111111211289 is 98211211111111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9038994146064 + 2072117065225 = 3006492^2 + 1439485^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111111211289 - 215 = 11111111178521 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11111111211289.
It is not a weakly prime, because it can be changed into another prime (11111111211283) 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, 5555555605644 + 5555555605645.
It is an arithmetic number, because the mean of its divisors is an integer number (5555555605645).
Almost surely, 211111111211289 is an apocalyptic number.
It is an amenable number.
11111111211289 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111111211289 is an equidigital number, since it uses as much as digits as its factorization.
11111111211289 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 288, while the sum is 31.
The spelling of 11111111211289 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, two hundred eleven thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •