Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0110001010011000111111 |
3 | 1110122211001101112212201121 |
4 | 2202333312312022120333 |
5 | 2432004344002243033 |
6 | 35453420215251411 |
7 | 2234153136465103 |
oct | 242776666123077 |
9 | 43584041485647 |
10 | 11201121134143 |
11 | 362940695a856 |
12 | 130aa28979b67 |
13 | 633351ab35c5 |
14 | 2aa1cc4d7903 |
15 | 14657828b62d |
hex | a2ff6d8a63f |
11201121134143 has 8 divisors (see below), whose sum is σ = 11872224853200. Its totient is φ = 10531374552960.
The previous prime is 11201121134131. The next prime is 11201121134153. The reversal of 11201121134143 is 34143112110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201121134143 is a prime.
It is a super-2 number, since 2×112011211341432 (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 (11201121134153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339267468 + ... + 339300481.
It is an arithmetic number, because the mean of its divisors is an integer number (1484028106650).
Almost surely, 211201121134143 is an apocalyptic number.
11201121134143 is a deficient number, since it is larger than the sum of its proper divisors (671103719057).
11201121134143 is an equidigital number, since it uses as much as digits as its factorization.
11201121134143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678568937.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 11201121134143 its reverse (34143112110211), we get a palindrome (45344233244354).
The spelling of 11201121134143 in words is "eleven trillion, two hundred one billion, one hundred twenty-one million, one hundred thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •