Base | Representation |
---|---|
bin | 1010001101101111001010… |
… | …1111101110111101000111 |
3 | 1110202200110212021101112112 |
4 | 2203123302233232331013 |
5 | 2433002311440023421 |
6 | 35515300505211235 |
7 | 2236264360210022 |
oct | 243336257567507 |
9 | 43680425241475 |
10 | 11231117111111 |
11 | 36400a98a6267 |
12 | 13147ba490b1b |
13 | 63612239a4c1 |
14 | 2ab8361b61b9 |
15 | 14723186d45b |
hex | a36f2beef47 |
11231117111111 has 2 divisors, whose sum is σ = 11231117111112. Its totient is φ = 11231117111110.
The previous prime is 11231117111057. The next prime is 11231117111153. The reversal of 11231117111111 is 11111171113211.
It is a m-pointer prime, because the next prime (11231117111153) can be obtained adding 11231117111111 to its product of digits (42).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11231117111111 - 26 = 11231117111047 is a prime.
It is a super-2 number, since 2×112311171111112 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11231117111411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615558555555 + 5615558555556.
It is an arithmetic number, because the mean of its divisors is an integer number (5615558555556).
Almost surely, 211231117111111 is an apocalyptic number.
11231117111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231117111111 is an equidigital number, since it uses as much as digits as its factorization.
11231117111111 is an evil number, because the sum of its binary digits is even.
The product of its digits is 42, while the sum is 23.
Adding to 11231117111111 its reverse (11111171113211), we get a palindrome (22342288224322).
The spelling of 11231117111111 in words is "eleven trillion, two hundred thirty-one billion, one hundred seventeen million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •