Base | Representation |
---|---|
bin | 10100110000001111… |
… | …10010000001010001 |
3 | 1001202111211220022101 |
4 | 22120013302001101 |
5 | 140304340030223 |
6 | 5041342040401 |
7 | 543053245354 |
oct | 123007620121 |
9 | 31674756271 |
10 | 11142111313 |
11 | 47a8482163 |
12 | 21ab579101 |
13 | 10874c3998 |
14 | 779b0429b |
15 | 4532b14ad |
hex | 2981f2051 |
11142111313 has 2 divisors, whose sum is σ = 11142111314. Its totient is φ = 11142111312.
The previous prime is 11142111301. The next prime is 11142111361. The reversal of 11142111313 is 31311124111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10382998609 + 759112704 = 101897^2 + 27552^2 .
It is a cyclic number.
It is not a de Polignac number, because 11142111313 - 213 = 11142103121 is a prime.
It is a super-2 number, since 2×111421113132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11142111413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5571055656 + 5571055657.
It is an arithmetic number, because the mean of its divisors is an integer number (5571055657).
Almost surely, 211142111313 is an apocalyptic number.
It is an amenable number.
11142111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11142111313 is an equidigital number, since it uses as much as digits as its factorization.
11142111313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72, while the sum is 19.
Adding to 11142111313 its reverse (31311124111), we get a palindrome (42453235424).
The spelling of 11142111313 in words is "eleven billion, one hundred forty-two million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •