Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1101000001100100101110 |
3 | 1110100020000011212220211201 |
4 | 2201230020131001210232 |
5 | 2424021240342033402 |
6 | 35344231445440114 |
7 | 2224521305361523 |
oct | 241541035014456 |
9 | 43306004786751 |
10 | 11111222221102 |
11 | 35a4274302903 |
12 | 12b5519a1003a |
13 | 627a25bc57c3 |
14 | 2a5b00bd114a |
15 | 144065c2b687 |
hex | a1b0874192e |
11111222221102 has 4 divisors (see below), whose sum is σ = 16666833331656. Its totient is φ = 5555611110550.
The previous prime is 11111222221087. The next prime is 11111222221109. The reversal of 11111222221102 is 20112222211111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11111222221102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111222221109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2777805555274 + ... + 2777805555277.
It is an arithmetic number, because the mean of its divisors is an integer number (4166708332914).
Almost surely, 211111222221102 is an apocalyptic number.
11111222221102 is a deficient number, since it is larger than the sum of its proper divisors (5555611110554).
11111222221102 is an equidigital number, since it uses as much as digits as its factorization.
11111222221102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5555611110553.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11111222221102 its reverse (20112222211111), we get a palindrome (31223444432213).
Subtracting 11111222221102 from its reverse (20112222211111), we obtain a palindrome (9000999990009).
The spelling of 11111222221102 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-two million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •