Base | Representation |
---|---|
bin | 1010011010000101100111… |
… | …0111010010111001101111 |
3 | 1111111222011021211121011012 |
4 | 2212201121313102321233 |
5 | 2444441334414402421 |
6 | 40200551340415435 |
7 | 2260515440504612 |
oct | 246413167227157 |
9 | 44458137747135 |
10 | 11443300544111 |
11 | 3712092915a57 |
12 | 134995624757b |
13 | 650138857817 |
14 | 2b7c043c4179 |
15 | 14c9ee6e895b |
hex | a6859dd2e6f |
11443300544111 has 4 divisors (see below), whose sum is σ = 11447339834112. Its totient is φ = 11439261254112.
The previous prime is 11443300544089. The next prime is 11443300544129. The reversal of 11443300544111 is 11144500334411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11443300544111 is a prime.
It is a super-2 number, since 2×114433005441112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11443300544131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2019640751 + ... + 2019646416.
It is an arithmetic number, because the mean of its divisors is an integer number (2861834958528).
Almost surely, 211443300544111 is an apocalyptic number.
11443300544111 is a deficient number, since it is larger than the sum of its proper divisors (4039290001).
11443300544111 is an equidigital number, since it uses as much as digits as its factorization.
11443300544111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4039290000.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 11443300544111 its reverse (11144500334411), we get a palindrome (22587800878522).
The spelling of 11443300544111 in words is "eleven trillion, four hundred forty-three billion, three hundred million, five hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •