Base | Representation |
---|---|
bin | 10101100001100110… |
… | …00010101100101111 |
3 | 1002211100211221220011 |
4 | 22300303002230233 |
5 | 142131330330012 |
6 | 5150411234051 |
7 | 556241162146 |
oct | 126063025457 |
9 | 32740757804 |
10 | 11556105007 |
11 | 49a0135807 |
12 | 22a6148927 |
13 | 11221c4875 |
14 | 7b8aac75d |
15 | 4797db1a7 |
hex | 2b0cc2b2f |
11556105007 has 8 divisors (see below), whose sum is σ = 12167625600. Its totient is φ = 10944914904.
The previous prime is 11556104999. The next prime is 11556105091. The reversal of 11556105007 is 70050165511.
11556105007 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 a cyclic number.
It is not a de Polignac number, because 11556105007 - 23 = 11556104999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11556105007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11556105707) 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, 9157 + ... + 152302.
It is an arithmetic number, because the mean of its divisors is an integer number (1520953200).
Almost surely, 211556105007 is an apocalyptic number.
11556105007 is a deficient number, since it is larger than the sum of its proper divisors (611520593).
11556105007 is a wasteful number, since it uses less digits than its factorization.
11556105007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165245.
The product of its (nonzero) digits is 5250, while the sum is 31.
The spelling of 11556105007 in words is "eleven billion, five hundred fifty-six million, one hundred five thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •