Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0001100010101100001101 |
3 | 1110022011022001200012012021 |
4 | 2201201301201202230031 |
5 | 2423331001112023432 |
6 | 35335152100210141 |
7 | 2223645554116063 |
oct | 241416141425415 |
9 | 43264261605167 |
10 | 11100100111117 |
11 | 359a587151a76 |
12 | 12b3335099951 |
13 | 6269728b5a34 |
14 | 2a5367a16033 |
15 | 143b145bb697 |
hex | a1871862b0d |
11100100111117 has 2 divisors, whose sum is σ = 11100100111118. Its totient is φ = 11100100111116.
The previous prime is 11100100111081. The next prime is 11100100111147. The reversal of 11100100111117 is 71111100100111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7664763897961 + 3435336213156 = 2768531^2 + 1853466^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100100111117 - 211 = 11100100109069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11100100111117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100100111147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550050055558 + 5550050055559.
It is an arithmetic number, because the mean of its divisors is an integer number (5550050055559).
Almost surely, 211100100111117 is an apocalyptic number.
It is an amenable number.
11100100111117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100100111117 is an equidigital number, since it uses as much as digits as its factorization.
11100100111117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 16.
Adding to 11100100111117 its reverse (71111100100111), we get a palindrome (82211200211228).
The spelling of 11100100111117 in words is "eleven trillion, one hundred billion, one hundred million, one hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •