Base | Representation |
---|---|
bin | 10100101011011111… |
… | …00010010010010101 |
3 | 1001122201202020121221 |
4 | 22111233202102111 |
5 | 140214130412411 |
6 | 5033354410341 |
7 | 542060102614 |
oct | 122557422225 |
9 | 31581666557 |
10 | 11102200981 |
11 | 47879a2a13 |
12 | 219a1309b1 |
13 | 107c15bbc1 |
14 | 7746b587b |
15 | 44ea2b071 |
hex | 295be2495 |
11102200981 has 2 divisors, whose sum is σ = 11102200982. Its totient is φ = 11102200980.
The previous prime is 11102200969. The next prime is 11102200997. The reversal of 11102200981 is 18900220111.
11102200981 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 can be written as a sum of positive squares in only one way, i.e., 11101993956 + 207025 = 105366^2 + 455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102200981 is a prime.
It is a super-2 number, since 2×111022009812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102200961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551100490 + 5551100491.
It is an arithmetic number, because the mean of its divisors is an integer number (5551100491).
Almost surely, 211102200981 is an apocalyptic number.
It is an amenable number.
11102200981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102200981 is an equidigital number, since it uses as much as digits as its factorization.
11102200981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 11102200981 in words is "eleven billion, one hundred two million, two hundred thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •