Base | Representation |
---|---|
bin | 10100110111010000… |
… | …11101110110110001 |
3 | 1001220121200022122202 |
4 | 22123220131312301 |
5 | 140414424323441 |
6 | 5051244312545 |
7 | 544400011046 |
oct | 123350356661 |
9 | 31817608582 |
10 | 11201011121 |
11 | 4828751493 |
12 | 2207242755 |
13 | 1096776c41 |
14 | 7838771cd |
15 | 45854819b |
hex | 29ba1ddb1 |
11201011121 has 2 divisors, whose sum is σ = 11201011122. Its totient is φ = 11201011120.
The previous prime is 11201011061. The next prime is 11201011139. The reversal of 11201011121 is 12111010211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11055471025 + 145540096 = 105145^2 + 12064^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201011121 - 26 = 11201011057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11201011181) 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, 5600505560 + 5600505561.
It is an arithmetic number, because the mean of its divisors is an integer number (5600505561).
Almost surely, 211201011121 is an apocalyptic number.
It is an amenable number.
11201011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201011121 is an equidigital number, since it uses as much as digits as its factorization.
11201011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11201011121 its reverse (12111010211), we get a palindrome (23312021332).
The spelling of 11201011121 in words is "eleven billion, two hundred one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •