Base | Representation |
---|---|
bin | 10101100001100011… |
… | …00010111101001101 |
3 | 1002211100010000221122 |
4 | 22300301202331031 |
5 | 142131230302340 |
6 | 5150355010325 |
7 | 556234636625 |
oct | 126061427515 |
9 | 32740100848 |
10 | 11555712845 |
11 | 499a998106 |
12 | 22a5b999a5 |
13 | 11220b8211 |
14 | 7b8a09885 |
15 | 47975edb5 |
hex | 2b0c62f4d |
11555712845 has 8 divisors (see below), whose sum is σ = 13944324960. Its totient is φ = 9192923920.
The previous prime is 11555712841. The next prime is 11555712859. The reversal of 11555712845 is 54821755511.
It is a happy number.
11555712845 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11555712845 - 22 = 11555712841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11555712796 and 11555712805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11555712841) 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 7 ways as a sum of consecutive naturals, for example, 6454811 + ... + 6456600.
It is an arithmetic number, because the mean of its divisors is an integer number (1743040620).
Almost surely, 211555712845 is an apocalyptic number.
It is an amenable number.
11555712845 is a deficient number, since it is larger than the sum of its proper divisors (2388612115).
11555712845 is a wasteful number, since it uses less digits than its factorization.
11555712845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12911595.
The product of its digits is 280000, while the sum is 44.
The spelling of 11555712845 in words is "eleven billion, five hundred fifty-five million, seven hundred twelve thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •