Base | Representation |
---|---|
bin | 10100110111001010… |
… | …00111010010101111 |
3 | 1001220120000200002202 |
4 | 22123211013102233 |
5 | 140414213213041 |
6 | 5051213412115 |
7 | 544356360566 |
oct | 123345072257 |
9 | 31816020082 |
10 | 11200132271 |
11 | 4828201169 |
12 | 2206a9a03b |
13 | 1096529c03 |
14 | 7836c8bdd |
15 | 458422a9b |
hex | 29b9474af |
11200132271 has 2 divisors, whose sum is σ = 11200132272. Its totient is φ = 11200132270.
The previous prime is 11200132261. The next prime is 11200132327. The reversal of 11200132271 is 17223100211.
It is a weak prime.
It is an emirp because it is prime and its reverse (17223100211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11200132271 - 218 = 11199870127 is a prime.
It is a super-3 number, since 3×112001322713 (a number of 31 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200132241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600066135 + 5600066136.
It is an arithmetic number, because the mean of its divisors is an integer number (5600066136).
Almost surely, 211200132271 is an apocalyptic number.
11200132271 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200132271 is an equidigital number, since it uses as much as digits as its factorization.
11200132271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 11200132271 its reverse (17223100211), we get a palindrome (28423232482).
The spelling of 11200132271 in words is "eleven billion, two hundred million, one hundred thirty-two thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •