Base | Representation |
---|---|
bin | 10100101100011011… |
… | …01101011111110101 |
3 | 1001200021122010102210 |
4 | 22112031231133311 |
5 | 140223142024341 |
6 | 5034240124033 |
7 | 542214246546 |
oct | 122615553765 |
9 | 31607563383 |
10 | 11110111221 |
11 | 4791406000 |
12 | 21a0906619 |
13 | 108099b511 |
14 | 7757744cd |
15 | 45058ec16 |
hex | 29636d7f5 |
11110111221 has 16 divisors (see below), whose sum is σ = 16293722688. Its totient is φ = 6733398320.
The previous prime is 11110111217. The next prime is 11110111223. The reversal of 11110111221 is 12211101111.
It is not a de Polignac number, because 11110111221 - 22 = 11110111217 is a prime.
It is a super-2 number, since 2×111101112212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11110111197 and 11110111206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110111223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1387206 + ... + 1395191.
It is an arithmetic number, because the mean of its divisors is an integer number (1018357668).
Almost surely, 211110111221 is an apocalyptic number.
11110111221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11110111221 is a deficient number, since it is larger than the sum of its proper divisors (5183611467).
11110111221 is an equidigital number, since it uses as much as digits as its factorization.
11110111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2782433 (or 2782411 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11110111221 its reverse (12211101111), we get a palindrome (23321212332).
The spelling of 11110111221 in words is "eleven billion, one hundred ten million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •