Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1110011000110110011100 |
3 | 1102222122211112022222221101 |
4 | 2200032332232120312130 |
5 | 2420401414424323400 |
6 | 35230250444042444 |
7 | 2214350553204343 |
oct | 240167656306634 |
9 | 42878745288841 |
10 | 11011201011100 |
11 | 3565907a00384 |
12 | 129a064b33424 |
13 | 61b475b9ac84 |
14 | 2a0d3300cb5a |
15 | 14165ec0256a |
hex | a03beb98d9c |
11011201011100 has 18 divisors (see below), whose sum is σ = 23894306194304. Its totient is φ = 4404480404400.
The previous prime is 11011201011091. The next prime is 11011201011101. The reversal of 11011201011100 is 111010211011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011201011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55056004956 + ... + 55056005155.
Almost surely, 211011201011100 is an apocalyptic number.
11011201011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011201011100 is an abundant number, since it is smaller than the sum of its proper divisors (12883105183204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011201011100 is a wasteful number, since it uses less digits than its factorization.
11011201011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110112010125 (or 110112010118 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11011201011100 its reverse (111010211011), we get a palindrome (11122211222111).
The spelling of 11011201011100 in words is "eleven trillion, eleven billion, two hundred one million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •