Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …010001111000111111101 |
3 | 10221010101120002222022120 |
4 | 100021313302033013331 |
5 | 121142001433021341 |
6 | 2205551132033153 |
7 | 143126406452463 |
oct | 20116762170775 |
9 | 3833346088276 |
10 | 1110111220221 |
11 | 398882930443 |
12 | 15b1920027b9 |
13 | 808b5837313 |
14 | 3ba302dc833 |
15 | 1dd234cd066 |
hex | 10277c8f1fd |
1110111220221 has 64 divisors (see below), whose sum is σ = 1692339609600. Its totient is φ = 643056454656.
The previous prime is 1110111220201. The next prime is 1110111220243. The reversal of 1110111220221 is 1220221110111.
It is a happy number.
It is not a de Polignac number, because 1110111220221 - 27 = 1110111220093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1110111220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110111220201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 192091110 + ... + 192096888.
It is an arithmetic number, because the mean of its divisors is an integer number (26442806400).
Almost surely, 21110111220221 is an apocalyptic number.
It is an amenable number.
1110111220221 is a deficient number, since it is larger than the sum of its proper divisors (582228389379).
1110111220221 is a wasteful number, since it uses less digits than its factorization.
1110111220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11498.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1110111220221 its reverse (1220221110111), we get a palindrome (2330332330332).
The spelling of 1110111220221 in words is "one trillion, one hundred ten billion, one hundred eleven million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •