Base | Representation |
---|---|
bin | 10100101110111010… |
… | …11100000000110000 |
3 | 1001201201221221201010 |
4 | 22113131130000300 |
5 | 140244014323440 |
6 | 5040304110520 |
7 | 542560014315 |
oct | 122735340060 |
9 | 31651857633 |
10 | 11131011120 |
11 | 47a2190449 |
12 | 21a7905440 |
13 | 1085108418 |
14 | 778454d0c |
15 | 45231c580 |
hex | 29775c030 |
11131011120 has 160 divisors (see below), whose sum is σ = 36770735808. Its totient is φ = 2775711744.
The previous prime is 11131011113. The next prime is 11131011179. The reversal of 11131011120 is 2111013111.
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 = 11131011096 and 11131011105.
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, 631872 + ... + 649248.
Almost surely, 211131011120 is an apocalyptic number.
11131011120 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 11131011120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18385367904).
11131011120 is an abundant number, since it is smaller than the sum of its proper divisors (25639724688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131011120 is a wasteful number, since it uses less digits than its factorization.
11131011120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17567 (or 17561 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 11131011120 its reverse (2111013111), we get a palindrome (13242024231).
The spelling of 11131011120 in words is "eleven billion, one hundred thirty-one million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •