Base | Representation |
---|---|
bin | 1010000001011101001000… |
… | …0111010010011101000000 |
3 | 1110000111211211220120010110 |
4 | 2200113102013102131000 |
5 | 2421023144224141232 |
6 | 35234323240231320 |
7 | 2215114516332033 |
oct | 240272207223500 |
9 | 43014754816113 |
10 | 11020116240192 |
11 | 3569672361a04 |
12 | 129b93276b540 |
13 | 61c266c0a467 |
14 | 2a153b07901a |
15 | 1419d2736acc |
hex | a05d21d2740 |
11020116240192 has 224 divisors, whose sum is σ = 32353127868672. Its totient is φ = 3292776103936.
The previous prime is 11020116240179. The next prime is 11020116240229. The reversal of 11020116240192 is 29104261102011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17176768 + ... + 17806784.
Almost surely, 211020116240192 is an apocalyptic number.
11020116240192 is a gapful number since it is divisible by the number (12) 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 11020116240192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16176563934336).
11020116240192 is an abundant number, since it is smaller than the sum of its proper divisors (21333011628480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020116240192 is a wasteful number, since it uses less digits than its factorization.
11020116240192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630305 (or 630295 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 30.
The spelling of 11020116240192 in words is "eleven trillion, twenty billion, one hundred sixteen million, two hundred forty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •