Base | Representation |
---|---|
bin | 1010000101100000111010… |
… | …0010011100101001100000 |
3 | 1110021011211200021122110101 |
4 | 2201120032202130221200 |
5 | 2423144002431011121 |
6 | 35330335001312144 |
7 | 2223133544110465 |
oct | 241301642345140 |
9 | 43234750248411 |
10 | 11089849469536 |
11 | 35961a6a06262 |
12 | 12b1354195654 |
13 | 6259cacbcb46 |
14 | 2a4a7448b66c |
15 | 1437146ee491 |
hex | a160e89ca60 |
11089849469536 has 48 divisors (see below), whose sum is σ = 22192604144928. Its totient is φ = 5453645184000.
The previous prime is 11089849469519. The next prime is 11089849469581. The reversal of 11089849469536 is 63596494898011.
It is a super-2 number, since 2×110898494695362 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 28994356 + ... + 29374348.
It is an arithmetic number, because the mean of its divisors is an integer number (462345919686).
Almost surely, 211089849469536 is an apocalyptic number.
11089849469536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11089849469536 is an abundant number, since it is smaller than the sum of its proper divisors (11102754675392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11089849469536 is a wasteful number, since it uses less digits than its factorization.
11089849469536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395015 (or 395007 counting only the distinct ones).
The product of its (nonzero) digits is 403107840, while the sum is 73.
The spelling of 11089849469536 in words is "eleven trillion, eighty-nine billion, eight hundred forty-nine million, four hundred sixty-nine thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •