Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1010000111100110100100 |
3 | 1102222122121220021101002101 |
4 | 2200032321322013212210 |
5 | 2420401233232400400 |
6 | 35230234440021444 |
7 | 2214345552262636 |
oct | 240167172074644 |
9 | 42878556241071 |
10 | 11011120200100 |
11 | 3565876325929 |
12 | 129a041a61884 |
13 | 61b462215707 |
14 | 2a0d263b4a56 |
15 | 141657a8d56a |
hex | a03b9e879a4 |
11011120200100 has 36 divisors (see below), whose sum is σ = 23899504889344. Its totient is φ = 4403457470880.
The previous prime is 11011120200097. The next prime is 11011120200107. The reversal of 11011120200100 is 100202111011.
It is a super-2 number, since 2×110111202001002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (11011120200107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11935692 + ... + 12825091.
Almost surely, 211011120200100 is an apocalyptic number.
11011120200100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011120200100 is an abundant number, since it is smaller than the sum of its proper divisors (12888384689244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011120200100 is a wasteful number, since it uses less digits than its factorization.
11011120200100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24765244 (or 24765237 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11011120200100 its reverse (100202111011), we get a palindrome (11111322311111).
The spelling of 11011120200100 in words is "eleven trillion, eleven billion, one hundred twenty million, two hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •