Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111000001110000001100 |
3 | 1102222122121020222000102200 |
4 | 2200032321113001300030 |
5 | 2420401223404013400 |
6 | 35230233510521500 |
7 | 2214345411140460 |
oct | 240167127016014 |
9 | 42878536860380 |
10 | 11011111001100 |
11 | 3565871112551 |
12 | 129a03a966290 |
13 | 61b460344612 |
14 | 2a0d2509c4a0 |
15 | 141656d72b00 |
hex | a03b95c1c0c |
11011111001100 has 216 divisors, whose sum is σ = 39447444472800. Its totient is φ = 2516621322240.
The previous prime is 11011111001089. The next prime is 11011111001129. The reversal of 11011111001100 is 110011111011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 85924674 + ... + 86052726.
Almost surely, 211011111001100 is an apocalyptic number.
11011111001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011111001100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19723722236400).
11011111001100 is an abundant number, since it is smaller than the sum of its proper divisors (28436333471700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011111001100 is a wasteful number, since it uses less digits than its factorization.
11011111001100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141729 (or 141719 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011111001100 its reverse (110011111011), we get a palindrome (11121122112111).
The spelling of 11011111001100 in words is "eleven trillion, eleven billion, one hundred eleven million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •