Base | Representation |
---|---|
bin | 10100101011010110… |
… | …11000011011000000 |
3 | 1001122122200220211022 |
4 | 22111223120123000 |
5 | 140213341041000 |
6 | 5033315205012 |
7 | 542044616006 |
oct | 122553303300 |
9 | 31578626738 |
10 | 11101112000 |
11 | 4787319830 |
12 | 21998a6768 |
13 | 107bb6a334 |
14 | 7744b0a76 |
15 | 44e8b3585 |
hex | 295ad86c0 |
11101112000 has 224 divisors, whose sum is σ = 30312360000. Its totient is φ = 3993600000.
The previous prime is 11101111999. The next prime is 11101112021. The reversal of 11101112000 is 21110111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
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, 8887376 + ... + 8888624.
Almost surely, 211101112000 is an apocalyptic number.
11101112000 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 11101112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15156180000).
11101112000 is an abundant number, since it is smaller than the sum of its proper divisors (19211248000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101112000 is a wasteful number, since it uses less digits than its factorization.
11101112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1388 (or 1368 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11101112000 its reverse (21110111), we get a palindrome (11122222111).
It can be divided in two parts, 1110111 and 2000, that added together give a palindrome (1112111).
The spelling of 11101112000 in words is "eleven billion, one hundred one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •