Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0111101011111101011101 |
3 | 1110100012110110122012021001 |
4 | 2201223323313223331131 |
5 | 2424020322320403103 |
6 | 35344154504510301 |
7 | 2224513133053513 |
oct | 241537367537535 |
9 | 43305413565231 |
10 | 11111011106653 |
11 | 35a4176119457 |
12 | 12b547b17b391 |
13 | 6279c1249603 |
14 | 2a5ac0b584b3 |
15 | 14405242901d |
hex | a1afbdebf5d |
11111011106653 has 2 divisors, whose sum is σ = 11111011106654. Its totient is φ = 11111011106652.
The previous prime is 11111011106597. The next prime is 11111011106677. The reversal of 11111011106653 is 35660111011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8206975907524 + 2904035199129 = 2864782^2 + 1704123^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111011106653 - 221 = 11111009009501 is a prime.
It is a super-3 number, since 3×111110111066533 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111011106053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555505553326 + 5555505553327.
It is an arithmetic number, because the mean of its divisors is an integer number (5555505553327).
Almost surely, 211111011106653 is an apocalyptic number.
It is an amenable number.
11111011106653 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111011106653 is an equidigital number, since it uses as much as digits as its factorization.
11111011106653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 28.
Adding to 11111011106653 its reverse (35660111011111), we get a palindrome (46771122117764).
The spelling of 11111011106653 in words is "eleven trillion, one hundred eleven billion, eleven million, one hundred six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •