Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0010011011001111111001 |
3 | 1110022020220112011022022002 |
4 | 2201202231302123033321 |
5 | 2423340033424420131 |
6 | 35335440254510345 |
7 | 2224012612016534 |
oct | 241425562331771 |
9 | 43266815138262 |
10 | 11101111170041 |
11 | 359aa55939562 |
12 | 12b35778053b5 |
13 | 626aa41c5759 |
14 | 2a5422001a1b |
15 | 143b732346cb |
hex | a18adc9b3f9 |
11101111170041 has 2 divisors, whose sum is σ = 11101111170042. Its totient is φ = 11101111170040.
The previous prime is 11101111170011. The next prime is 11101111170059. The reversal of 11101111170041 is 14007111110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5786449494016 + 5314661676025 = 2405504^2 + 2305355^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101111170041 - 210 = 11101111169017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11101111169995 and 11101111170022.
It is not a weakly prime, because it can be changed into another prime (11101111170001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555585020 + 5550555585021.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555585021).
Almost surely, 211101111170041 is an apocalyptic number.
It is an amenable number.
11101111170041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101111170041 is an equidigital number, since it uses as much as digits as its factorization.
11101111170041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 20.
Adding to 11101111170041 its reverse (14007111110111), we get a palindrome (25108222280152).
The spelling of 11101111170041 in words is "eleven trillion, one hundred one billion, one hundred eleven million, one hundred seventy thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •