Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …011000000111010111110 |
3 | 10220021102021222120211111 |
4 | 100001211103000322332 |
5 | 121020240021023402 |
6 | 2201520035512234 |
7 | 142363016000464 |
oct | 20014523007276 |
9 | 3807367876744 |
10 | 1101211111102 |
11 | 395025a66763 |
12 | 15950945867a |
13 | 7cac798cc6b |
14 | 3b42828a834 |
15 | 1d9a1e839d7 |
hex | 100654c0ebe |
1101211111102 has 32 divisors (see below), whose sum is σ = 1694687054400. Its totient is φ = 536461685760.
The previous prime is 1101211111097. The next prime is 1101211111141. The reversal of 1101211111102 is 2011111121011.
It is a super-2 number, since 2×11012111111022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 116760327 + ... + 116769757.
It is an arithmetic number, because the mean of its divisors is an integer number (52958970450).
Almost surely, 21101211111102 is an apocalyptic number.
1101211111102 is a deficient number, since it is larger than the sum of its proper divisors (593475943298).
1101211111102 is a wasteful number, since it uses less digits than its factorization.
1101211111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17028.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1101211111102 its reverse (2011111121011), we get a palindrome (3112322232113).
Subtracting 1101211111102 from its reverse (2011111121011), we obtain a palindrome (909900009909).
The spelling of 1101211111102 in words is "one trillion, one hundred one billion, two hundred eleven million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •