Base | Representation |
---|---|
bin | 1010000110110100010010… |
… | …0110011110100100101111 |
3 | 1110100022121111201001221201 |
4 | 2201231010212132210233 |
5 | 2424030322210112033 |
6 | 35344515534310331 |
7 | 2224555310600314 |
oct | 241550446364457 |
9 | 43308544631851 |
10 | 11112231332143 |
11 | 35a4741989977 |
12 | 12b575b9583a7 |
13 | 627b56ca2a26 |
14 | 2a5b98c30d0b |
15 | 1440c460c47d |
hex | a1b4499e92f |
11112231332143 has 2 divisors, whose sum is σ = 11112231332144. Its totient is φ = 11112231332142.
The previous prime is 11112231332119. The next prime is 11112231332173. The reversal of 11112231332143 is 34123313221111.
It is a happy number.
11112231332143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (34123313221111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11112231332143 - 29 = 11112231331631 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112231332173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556115666071 + 5556115666072.
It is an arithmetic number, because the mean of its divisors is an integer number (5556115666072).
Almost surely, 211112231332143 is an apocalyptic number.
11112231332143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112231332143 is an equidigital number, since it uses as much as digits as its factorization.
11112231332143 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 28.
Adding to 11112231332143 its reverse (34123313221111), we get a palindrome (45235544553254).
The spelling of 11112231332143 in words is "eleven trillion, one hundred twelve billion, two hundred thirty-one million, three hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •