Base | Representation |
---|---|
bin | 1010000001101111011110… |
… | …1100000110110100001111 |
3 | 1110000222120002212120201222 |
4 | 2200123313230012310033 |
5 | 2421113241123204033 |
6 | 35240500104153555 |
7 | 2215350544333502 |
oct | 240336754066417 |
9 | 43028502776658 |
10 | 11025041616143 |
11 | 357076a62a845 |
12 | 12a08881688bb |
13 | 61c87046b8b9 |
14 | 2a1887273139 |
15 | 141bbed4c598 |
hex | a06f7b06d0f |
11025041616143 has 4 divisors (see below), whose sum is σ = 11025116846520. Its totient is φ = 11024966385768.
The previous prime is 11025041616133. The next prime is 11025041616203. The reversal of 11025041616143 is 34161614052011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11025041616143 - 226 = 11024974507279 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 (11025041616133) 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 3 ways as a sum of consecutive naturals, for example, 37394933 + ... + 37688606.
It is an arithmetic number, because the mean of its divisors is an integer number (2756279211630).
Almost surely, 211025041616143 is an apocalyptic number.
11025041616143 is a deficient number, since it is larger than the sum of its proper divisors (75230377).
11025041616143 is an equidigital number, since it uses as much as digits as its factorization.
11025041616143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75230376.
The product of its (nonzero) digits is 17280, while the sum is 35.
Adding to 11025041616143 its reverse (34161614052011), we get a palindrome (45186655668154).
The spelling of 11025041616143 in words is "eleven trillion, twenty-five billion, forty-one million, six hundred sixteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •