Base | Representation |
---|---|
bin | 10100100001001111… |
… | …10111000100000000 |
3 | 1001102202010011112121 |
4 | 22100213313010000 |
5 | 140030133142343 |
6 | 5021045334024 |
7 | 536665013005 |
oct | 122047670400 |
9 | 31382104477 |
10 | 11016302848 |
11 | 4743463421 |
12 | 2175407314 |
13 | 1067414cc5 |
14 | 7671158ac |
15 | 44720eaed |
hex | 2909f7100 |
11016302848 has 144 divisors (see below), whose sum is σ = 23711708160. Its totient is φ = 5096448000.
The previous prime is 11016302837. The next prime is 11016302867. The reversal of 11016302848 is 84820361011.
It is a super-2 number, since 2×110163028482 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34751586 + ... + 34751902.
It is an arithmetic number, because the mean of its divisors is an integer number (164664640).
Almost surely, 211016302848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11016302848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11855854080).
11016302848 is an abundant number, since it is smaller than the sum of its proper divisors (12695405312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11016302848 is a wasteful number, since it uses less digits than its factorization.
11016302848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544 (or 530 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 34.
Adding to 11016302848 its reverse (84820361011), we get a palindrome (95836663859).
The spelling of 11016302848 in words is "eleven billion, sixteen million, three hundred two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •