Base | Representation |
---|---|
bin | 10100100001101110… |
… | …01011110100000000 |
3 | 1001110000200021001000 |
4 | 22100313023310000 |
5 | 140032200220000 |
6 | 5021311412000 |
7 | 540044113554 |
oct | 122067136400 |
9 | 31400607030 |
10 | 11020320000 |
11 | 4745757588 |
12 | 2176824000 |
13 | 10681c0611 |
14 | 76787d864 |
15 | 447755000 |
hex | 290dcbd00 |
11020320000 has 360 divisors, whose sum is σ = 40739209280. Its totient is φ = 2937600000.
The previous prime is 11020319987. The next prime is 11020320043. The reversal of 11020320000 is 2302011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (360).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a zygodrome in base 15.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4318725 + ... + 4321275.
Almost surely, 211020320000 is an apocalyptic number.
11020320000 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 11020320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20369604640).
11020320000 is an abundant number, since it is smaller than the sum of its proper divisors (29718889280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020320000 is an frugal number, since it uses more digits than its factorization.
11020320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2596 (or 2561 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 11020320000 its reverse (2302011), we get a palindrome (11022622011).
The spelling of 11020320000 in words is "eleven billion, twenty million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.348 sec. • engine limits •