Base | Representation |
---|---|
bin | 10100101011011000… |
… | …01011010000011101 |
3 | 1001122200002111110012 |
4 | 22111230023100131 |
5 | 140213414221341 |
6 | 5033323453005 |
7 | 542046444035 |
oct | 122554132035 |
9 | 31580074405 |
10 | 11101320221 |
11 | 4787451212 |
12 | 2199987165 |
13 | 107bc11044 |
14 | 7745268c5 |
15 | 44e9050eb |
hex | 295b0b41d |
11101320221 has 2 divisors, whose sum is σ = 11101320222. Its totient is φ = 11101320220.
The previous prime is 11101320203. The next prime is 11101320257. The reversal of 11101320221 is 12202310111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10818912196 + 282408025 = 104014^2 + 16805^2 .
It is an emirp because it is prime and its reverse (12202310111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101320221 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11101320196 and 11101320205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101320721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550660110 + 5550660111.
It is an arithmetic number, because the mean of its divisors is an integer number (5550660111).
Almost surely, 211101320221 is an apocalyptic number.
It is an amenable number.
11101320221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101320221 is an equidigital number, since it uses as much as digits as its factorization.
11101320221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11101320221 its reverse (12202310111), we get a palindrome (23303630332).
The spelling of 11101320221 in words is "eleven billion, one hundred one million, three hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •