Base | Representation |
---|---|
bin | 10100110111010001… |
… | …10110100000111000 |
3 | 1001220121212110012110 |
4 | 22123220312200320 |
5 | 140414441041440 |
6 | 5051250412320 |
7 | 544400611362 |
oct | 123350664070 |
9 | 31817773173 |
10 | 11201112120 |
11 | 4828810360 |
12 | 22072910a0 |
13 | 10967b0bc3 |
14 | 7838a1d32 |
15 | 458568080 |
hex | 29ba36838 |
11201112120 has 128 divisors (see below), whose sum is σ = 37649111040. Its totient is φ = 2642019840.
The previous prime is 11201112119. The next prime is 11201112187. The reversal of 11201112120 is 2121110211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11201112096 and 11201112105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65832 + ... + 163511.
It is an arithmetic number, because the mean of its divisors is an integer number (294133680).
Almost surely, 211201112120 is an apocalyptic number.
11201112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11201112120 is an abundant number, since it is smaller than the sum of its proper divisors (26447998920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201112120 is a wasteful number, since it uses less digits than its factorization.
11201112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229405 (or 229401 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11201112120 its reverse (2121110211), we get a palindrome (13322222331).
It can be divided in two parts, 11201 and 112120, that added together give a palindrome (123321).
The spelling of 11201112120 in words is "eleven billion, two hundred one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •