Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1001100110001000011100 |
3 | 1102222122100021210222221100 |
4 | 2200032303121212020130 |
5 | 2420401022304323400 |
6 | 35230215535433100 |
7 | 2214343055216442 |
oct | 240166331461034 |
9 | 42878307728840 |
10 | 11011011011100 |
11 | 356581a728591 |
12 | 129a011385790 |
13 | 61b445705539 |
14 | 2a0d15ab0b92 |
15 | 14164d1c1100 |
hex | a03b366621c |
11011011011100 has 108 divisors (see below), whose sum is σ = 34624378741680. Its totient is φ = 2926828147200.
The previous prime is 11011011010999. The next prime is 11011011011113. The reversal of 11011011011100 is 111011011011.
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 35 ways as a sum of consecutive naturals, for example, 19389645 + ... + 19949444.
It is an arithmetic number, because the mean of its divisors is an integer number (320596099460).
Almost surely, 211011011011100 is an apocalyptic number.
11011011011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011011011100 is an abundant number, since it is smaller than the sum of its proper divisors (23613367730580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011011011100 is a wasteful number, since it uses less digits than its factorization.
11011011011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39339420 (or 39339410 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011011011100 its reverse (111011011011), we get a palindrome (11122022022111).
The spelling of 11011011011100 in words is "eleven trillion, eleven billion, eleven million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •