Base | Representation |
---|---|
bin | 110011101111111100… |
… | …0100100110000111101 |
3 | 101121211212022210200102 |
4 | 1213133320210300331 |
5 | 3310043331112341 |
6 | 123015204410445 |
7 | 11012625144446 |
oct | 1473770446075 |
9 | 347755283612 |
10 | 111130332221 |
11 | 431481a2477 |
12 | 196553a6a25 |
13 | a63073ab3c |
14 | 554337a2cd |
15 | 2d56470c9b |
hex | 19dfe24c3d |
111130332221 has 2 divisors, whose sum is σ = 111130332222. Its totient is φ = 111130332220.
The previous prime is 111130332199. The next prime is 111130332223. The reversal of 111130332221 is 122233031111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110735872900 + 394459321 = 332770^2 + 19861^2 .
It is a cyclic number.
It is not a de Polignac number, because 111130332221 - 214 = 111130315837 is a prime.
Together with 111130332223, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 111130332193 and 111130332202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111130332223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55565166110 + 55565166111.
It is an arithmetic number, because the mean of its divisors is an integer number (55565166111).
Almost surely, 2111130332221 is an apocalyptic number.
It is an amenable number.
111130332221 is a deficient number, since it is larger than the sum of its proper divisors (1).
111130332221 is an equidigital number, since it uses as much as digits as its factorization.
111130332221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 111130332221 its reverse (122233031111), we get a palindrome (233363363332).
The spelling of 111130332221 in words is "one hundred eleven billion, one hundred thirty million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •