Base | Representation |
---|---|
bin | 1010001001000010001110… |
… | …0101000010001010011101 |
3 | 1110110221221210212002212210 |
4 | 2202100203211002022131 |
5 | 2430141334443324130 |
6 | 35414220344151033 |
7 | 2230404423200214 |
oct | 242204345021235 |
9 | 43427853762783 |
10 | 11150332011165 |
11 | 3609913805a56 |
12 | 1301013768479 |
13 | 62b6196cb809 |
14 | 2a797107007b |
15 | 1450a44bc5b0 |
hex | a242394229d |
11150332011165 has 64 divisors (see below), whose sum is σ = 18807402700800. Its totient is φ = 5625487296000.
The previous prime is 11150332011163. The next prime is 11150332011173. The reversal of 11150332011165 is 56111023305111.
It is not a de Polignac number, because 11150332011165 - 21 = 11150332011163 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11150332011163) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1559265340 + ... + 1559272490.
It is an arithmetic number, because the mean of its divisors is an integer number (293865667200).
Almost surely, 211150332011165 is an apocalyptic number.
11150332011165 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11150332011165 is a deficient number, since it is larger than the sum of its proper divisors (7657070689635).
11150332011165 is a wasteful number, since it uses less digits than its factorization.
11150332011165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14538.
The product of its (nonzero) digits is 2700, while the sum is 30.
Adding to 11150332011165 its reverse (56111023305111), we get a palindrome (67261355316276).
The spelling of 11150332011165 in words is "eleven trillion, one hundred fifty billion, three hundred thirty-two million, eleven thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •