Base | Representation |
---|---|
bin | 1010000110110001111110… |
… | …1000100001011100000011 |
3 | 1110100021000021122120201121 |
4 | 2201230133220201130003 |
5 | 2424023034421024141 |
6 | 35344334221013111 |
7 | 2224534040032024 |
oct | 241543750413403 |
9 | 43307007576647 |
10 | 11111611111171 |
11 | 35a445387a75a |
12 | 12b56080b4197 |
13 | 627a8864727c |
14 | 2a5b3a702c4b |
15 | 144089e481d1 |
hex | a1b1fa21703 |
11111611111171 has 2 divisors, whose sum is σ = 11111611111172. Its totient is φ = 11111611111170.
The previous prime is 11111611111103. The next prime is 11111611111213. The reversal of 11111611111171 is 17111111611111.
It is a happy number.
It is a m-pointer prime, because the next prime (11111611111213) can be obtained adding 11111611111171 to its product of digits (42).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11111611111171 - 227 = 11111476893443 is a prime.
It is not a weakly prime, because it can be changed into another prime (11111611211171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555805555585 + 5555805555586.
It is an arithmetic number, because the mean of its divisors is an integer number (5555805555586).
Almost surely, 211111611111171 is an apocalyptic number.
11111611111171 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111611111171 is an equidigital number, since it uses as much as digits as its factorization.
11111611111171 is an evil number, because the sum of its binary digits is even.
The product of its digits is 42, while the sum is 25.
Adding to 11111611111171 its reverse (17111111611111), we get a palindrome (28222722722282).
The spelling of 11111611111171 in words is "eleven trillion, one hundred eleven billion, six hundred eleven million, one hundred eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •