Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1101111010000110001110 |
3 | 1102221200202122101022220000 |
4 | 2200011210231322012032 |
5 | 2420220223324013402 |
6 | 35221500325505130 |
7 | 2213542352426142 |
oct | 240054455720616 |
9 | 42850678338800 |
10 | 11001101001102 |
11 | 35615a4798383 |
12 | 12981065721a6 |
13 | 61a5265655b4 |
14 | 2a0655895222 |
15 | 14126d18bc1c |
hex | a0164b7a18e |
11001101001102 has 80 divisors (see below), whose sum is σ = 25586382966144. Its totient is φ = 3529135656000.
The previous prime is 11001101001091. The next prime is 11001101001119. The reversal of 11001101001102 is 20110010110011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5142349 + ... + 6960312.
Almost surely, 211001101001102 is an apocalyptic number.
11001101001102 is an abundant number, since it is smaller than the sum of its proper divisors (14585281965042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001101001102 is a wasteful number, since it uses less digits than its factorization.
11001101001102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12102887 (or 12102878 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11001101001102 its reverse (20110010110011), we get a palindrome (31111111111113).
The spelling of 11001101001102 in words is "eleven trillion, one billion, one hundred one million, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •