Base | Representation |
---|---|
bin | 1010000110010110101111… |
… | …1000110011001110100101 |
3 | 1110022120010210110200012110 |
4 | 2201211223320303032211 |
5 | 2423413101412342130 |
6 | 35341124545311233 |
7 | 2224154630000220 |
oct | 241455370631645 |
9 | 43276123420173 |
10 | 11104300512165 |
11 | 35a13421724a3 |
12 | 12b4107935519 |
13 | 627191ba2143 |
14 | 2a56458145b7 |
15 | 143cad229ab0 |
hex | a196be333a5 |
11104300512165 has 32 divisors (see below), whose sum is σ = 20533152810240. Its totient is φ = 5019215122944.
The previous prime is 11104300512161. The next prime is 11104300512229. The reversal of 11104300512165 is 56121500340111.
It is not a de Polignac number, because 11104300512165 - 22 = 11104300512161 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11104300512161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 594121234 + ... + 594139923.
It is an arithmetic number, because the mean of its divisors is an integer number (641661025320).
Almost surely, 211104300512165 is an apocalyptic number.
11104300512165 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11104300512165 is a deficient number, since it is larger than the sum of its proper divisors (9428852298075).
11104300512165 is a wasteful number, since it uses less digits than its factorization.
11104300512165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188261261.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 11104300512165 its reverse (56121500340111), we get a palindrome (67225800852276).
The spelling of 11104300512165 in words is "eleven trillion, one hundred four billion, three hundred million, five hundred twelve thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •