Base | Representation |
---|---|
bin | 10100101101100111… |
… | …10110110111111100 |
3 | 1001200222110011200200 |
4 | 22112303312313330 |
5 | 140233222023400 |
6 | 5035234323500 |
7 | 542365245660 |
oct | 122663666774 |
9 | 31628404620 |
10 | 11120111100 |
11 | 479701606a |
12 | 21a4129590 |
13 | 1082a8ccc7 |
14 | 776c188a0 |
15 | 4513b7b00 |
hex | 296cf6dfc |
11120111100 has 216 divisors, whose sum is σ = 40340751360. Its totient is φ = 2509453440.
The previous prime is 11120111099. The next prime is 11120111117. The reversal of 11120111100 is 111102111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 486529 + ... + 508871.
Almost surely, 211120111100 is an apocalyptic number.
11120111100 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 11120111100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20170375680).
11120111100 is an abundant number, since it is smaller than the sum of its proper divisors (29220640260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120111100 is a wasteful number, since it uses less digits than its factorization.
11120111100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22449 (or 22439 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11120111100 its reverse (111102111), we get a palindrome (11231213211).
It can be divided in two parts, 1112011 and 1100, that added together give a palindrome (1113111).
The spelling of 11120111100 in words is "eleven billion, one hundred twenty million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •