Base | Representation |
---|---|
bin | 1010001001000010001110… |
… | …0100111111011110010111 |
3 | 1110110221221210211112202212 |
4 | 2202100203210333132113 |
5 | 2430141334443001101 |
6 | 35414220344024035 |
7 | 2230404423123131 |
oct | 242204344773627 |
9 | 43427853745685 |
10 | 11150332000151 |
11 | 36099137a8753 |
12 | 130101376201b |
13 | 62b6196c67b6 |
14 | 2a797106a051 |
15 | 1450a44b91bb |
hex | a242393f797 |
11150332000151 has 8 divisors (see below), whose sum is σ = 11155120705680. Its totient is φ = 11145543634368.
The previous prime is 11150332000021. The next prime is 11150332000153. The reversal of 11150332000151 is 15100023305111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11150332000151 - 210 = 11150331999127 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11150332000153) 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 7 ways as a sum of consecutive naturals, for example, 82515920 + ... + 82650938.
It is an arithmetic number, because the mean of its divisors is an integer number (1394390088210).
Almost surely, 211150332000151 is an apocalyptic number.
11150332000151 is a deficient number, since it is larger than the sum of its proper divisors (4788705529).
11150332000151 is a wasteful number, since it uses less digits than its factorization.
11150332000151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169873.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 11150332000151 its reverse (15100023305111), we get a palindrome (26250355305262).
The spelling of 11150332000151 in words is "eleven trillion, one hundred fifty billion, three hundred thirty-two million, one hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •