Base | Representation |
---|---|
bin | 10101100111100111… |
… | …10101100000000101 |
3 | 1002221212221122101011 |
4 | 22303303311200011 |
5 | 142232300112431 |
6 | 5155414402221 |
7 | 560423565256 |
oct | 126363654005 |
9 | 32855848334 |
10 | 11606644741 |
11 | 4a16714a8a |
12 | 22bb060371 |
13 | 112c80b833 |
14 | 7c16a6b2d |
15 | 47de70cb1 |
hex | 2b3cf5805 |
11606644741 has 24 divisors (see below), whose sum is σ = 12883500000. Its totient is φ = 10414901952.
The previous prime is 11606644739. The next prime is 11606644759. The reversal of 11606644741 is 14744660611.
It is a happy number.
11606644741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11606644741 - 21 = 11606644739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11606644694 and 11606644703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11606644781) 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 23 ways as a sum of consecutive naturals, for example, 1544010 + ... + 1551508.
It is an arithmetic number, because the mean of its divisors is an integer number (536812500).
Almost surely, 211606644741 is an apocalyptic number.
It is an amenable number.
11606644741 is a deficient number, since it is larger than the sum of its proper divisors (1276855259).
11606644741 is an equidigital number, since it uses as much as digits as its factorization.
11606644741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7653 (or 7600 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 40.
The spelling of 11606644741 in words is "eleven billion, six hundred six million, six hundred forty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •