Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101001011000101010101 |
3 | 1110100012201102210221102122 |
4 | 2201230001311023011111 |
5 | 2424021023421022442 |
6 | 35344212440145325 |
7 | 2224515456064412 |
oct | 241540165130525 |
9 | 43305642727378 |
10 | 11111111110997 |
11 | 35a4217613177 |
12 | 12b54a8768245 |
13 | 627a08b92091 |
14 | 2a5ad014b109 |
15 | 14405b0cedd2 |
hex | a1b01d4b155 |
11111111110997 has 2 divisors, whose sum is σ = 11111111110998. Its totient is φ = 11111111110996.
The previous prime is 11111111110993. The next prime is 11111111111017. The reversal of 11111111110997 is 79901111111111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10920420815236 + 190690295761 = 3304606^2 + 436681^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111111110997 - 22 = 11111111110993 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111111110993) 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, 5555555555498 + 5555555555499.
It is an arithmetic number, because the mean of its divisors is an integer number (5555555555499).
Almost surely, 211111111110997 is an apocalyptic number.
It is an amenable number.
11111111110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111111110997 is an equidigital number, since it uses as much as digits as its factorization.
11111111110997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 35.
The spelling of 11111111110997 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •