Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1010111001011110000101 |
3 | 1102221200202120220020120202 |
4 | 2200011210222321132011 |
5 | 2420220223123241401 |
6 | 35221500300540245 |
7 | 2213542342631636 |
oct | 240054452713605 |
9 | 42850676806522 |
10 | 11001100212101 |
11 | 35615a42a960a |
12 | 1298106251685 |
13 | 61a52634a42c |
14 | 2a065572b88d |
15 | 14126d08306b |
hex | a0164ab9785 |
11001100212101 has 2 divisors, whose sum is σ = 11001100212102. Its totient is φ = 11001100212100.
The previous prime is 11001100212077. The next prime is 11001100212173. The reversal of 11001100212101 is 10121200110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10565269181476 + 435831030625 = 3250426^2 + 660175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001100212101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001100214101) 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, 5500550106050 + 5500550106051.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550106051).
Almost surely, 211001100212101 is an apocalyptic number.
It is an amenable number.
11001100212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001100212101 is an equidigital number, since it uses as much as digits as its factorization.
11001100212101 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 11001100212101 its reverse (10121200110011), we get a palindrome (21122300322112).
The spelling of 11001100212101 in words is "eleven trillion, one billion, one hundred million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •