Base | Representation |
---|---|
bin | 1010000110000111100010… |
… | …1010111010111001110101 |
3 | 1110022011121102021200200101 |
4 | 2201201320222322321311 |
5 | 2423331222310310401 |
6 | 35335212022114101 |
7 | 2223651541206565 |
oct | 241417052727165 |
9 | 43264542250611 |
10 | 11100220010101 |
11 | 359a6388a4942 |
12 | 12b336927b931 |
13 | 6269916a5991 |
14 | 2a5379906da5 |
15 | 143b1eda2101 |
hex | a1878abae75 |
11100220010101 has 2 divisors, whose sum is σ = 11100220010102. Its totient is φ = 11100220010100.
The previous prime is 11100220010081. The next prime is 11100220010129. The reversal of 11100220010101 is 10101002200111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7144934346001 + 3955285664100 = 2673001^2 + 1988790^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100220010101 - 25 = 11100220010069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100220010141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550110005050 + 5550110005051.
It is an arithmetic number, because the mean of its divisors is an integer number (5550110005051).
Almost surely, 211100220010101 is an apocalyptic number.
It is an amenable number.
11100220010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100220010101 is an equidigital number, since it uses as much as digits as its factorization.
11100220010101 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 10.
Adding to 11100220010101 its reverse (10101002200111), we get a palindrome (21201222210212).
The spelling of 11100220010101 in words is "eleven trillion, one hundred billion, two hundred twenty million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •