Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0100000100101000010000 |
3 | 1110022011001002111122222200 |
4 | 2201201223210010220100 |
5 | 2423330300012023440 |
6 | 35335134125003200 |
7 | 2223643231123644 |
oct | 241415344045020 |
9 | 43264032448880 |
10 | 11100000111120 |
11 | 359a535760548 |
12 | 12b33076b3500 |
13 | 626957c7223b |
14 | 2a5358624c24 |
15 | 143b0a916c30 |
hex | a186b904a10 |
11100000111120 has 60 divisors (see below), whose sum is σ = 37277500375596. Its totient is φ = 2960000029440.
The previous prime is 11100000111071. The next prime is 11100000111131. The reversal of 11100000111120 is 2111100000111.
It can be written as a sum of positive squares in 2 ways, for example, as 5356576967184 + 5743423143936 = 2314428^2 + 2396544^2 .
It is a tau number, because it is divible by the number of its divisors (60).
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 11 ways as a sum of consecutive naturals, for example, 7708332691 + ... + 7708334130.
Almost surely, 211100000111120 is an apocalyptic number.
11100000111120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11100000111120 is an abundant number, since it is smaller than the sum of its proper divisors (26177500264476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100000111120 is a wasteful number, since it uses less digits than its factorization.
11100000111120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15416666840 (or 15416666831 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11100000111120 its reverse (2111100000111), we get a palindrome (13211100111231).
The spelling of 11100000111120 in words is "eleven trillion, one hundred billion, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •