Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0111101010011000111101 |
3 | 1110100012110110121212102211 |
4 | 2201223323313222120331 |
5 | 2424020322320201341 |
6 | 35344154504420421 |
7 | 2224513133025664 |
oct | 241537367523075 |
9 | 43305413555384 |
10 | 11111011100221 |
11 | 35a417611463a |
12 | 12b547b177711 |
13 | 6279c12466c6 |
14 | 2a5ac0b55ddb |
15 | 144052427181 |
hex | a1afbdea63d |
11111011100221 has 2 divisors, whose sum is σ = 11111011100222. Its totient is φ = 11111011100220.
The previous prime is 11111011100087. The next prime is 11111011100227. The reversal of 11111011100221 is 12200111011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7014896559225 + 4096114540996 = 2648565^2 + 2023886^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111011100221 - 29 = 11111011099709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111011100227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555505550110 + 5555505550111.
It is an arithmetic number, because the mean of its divisors is an integer number (5555505550111).
Almost surely, 211111011100221 is an apocalyptic number.
It is an amenable number.
11111011100221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111011100221 is an equidigital number, since it uses as much as digits as its factorization.
11111011100221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11111011100221 its reverse (12200111011111), we get a palindrome (23311122111332).
The spelling of 11111011100221 in words is "eleven trillion, one hundred eleven billion, eleven million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •