Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …100110111001100101110 |
3 | 10221012200120120121101201 |
4 | 100022230310313030232 |
5 | 121200312240213402 |
6 | 2210215321200114 |
7 | 143160433354414 |
oct | 20125464671456 |
9 | 3835616517351 |
10 | 1111001101102 |
11 | 39919a181092 |
12 | 15b3a003003a |
13 | 809c7cc9b59 |
14 | 3bab65832b4 |
15 | 1dd766ab687 |
hex | 102acd3732e |
1111001101102 has 8 divisors (see below), whose sum is σ = 1683001668312. Its totient is φ = 550000545000.
The previous prime is 1111001101079. The next prime is 1111001101141. The reversal of 1111001101102 is 2011011001111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11110011011022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2750002524 + ... + 2750002927.
It is an arithmetic number, because the mean of its divisors is an integer number (210375208539).
Almost surely, 21111001101102 is an apocalyptic number.
1111001101102 is a deficient number, since it is larger than the sum of its proper divisors (572000567210).
1111001101102 is a wasteful number, since it uses less digits than its factorization.
1111001101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5500005554.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1111001101102 its reverse (2011011001111), we get a palindrome (3122012102213).
Subtracting 1111001101102 from its reverse (2011011001111), we obtain a palindrome (900009900009).
The spelling of 1111001101102 in words is "one trillion, one hundred eleven billion, one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •