Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …1111110001001110111001 |
3 | 1110100012201122001001201102 |
4 | 2201230001333301032321 |
5 | 2424021030123414242 |
6 | 35344213015501145 |
7 | 2224515521513564 |
oct | 241540177611671 |
9 | 43305648031642 |
10 | 11111113888697 |
11 | 35a4219140099 |
12 | 12b54a96877b5 |
13 | 627a096254a4 |
14 | 2a5ad06714db |
15 | 14405b47ce32 |
hex | a1b01ff13b9 |
11111113888697 has 2 divisors, whose sum is σ = 11111113888698. Its totient is φ = 11111113888696.
The previous prime is 11111113888691. The next prime is 11111113888729. The reversal of 11111113888697 is 79688831111111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10159193647801 + 951920240896 = 3187349^2 + 975664^2 .
It is an emirp because it is prime and its reverse (79688831111111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11111113888697 - 228 = 11110845453241 is a prime.
It is not a weakly prime, because it can be changed into another prime (11111113888691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555556944348 + 5555556944349.
It is an arithmetic number, because the mean of its divisors is an integer number (5555556944349).
Almost surely, 211111113888697 is an apocalyptic number.
It is an amenable number.
11111113888697 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111113888697 is an equidigital number, since it uses as much as digits as its factorization.
11111113888697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 580608, while the sum is 56.
The spelling of 11111113888697 in words is "eleven trillion, one hundred eleven billion, one hundred thirteen million, eight hundred eighty-eight thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •