Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11110111100011101 |
3 | 1001110000022220221101 |
4 | 22100312132330131 |
5 | 140032123324341 |
6 | 5021303433101 |
7 | 540042420013 |
oct | 122066367435 |
9 | 31400286841 |
10 | 11020136221 |
11 | 47456414a6 |
12 | 2176755791 |
13 | 1068157a83 |
14 | 7678328b3 |
15 | 44771a831 |
hex | 290d9ef1d |
11020136221 has 2 divisors, whose sum is σ = 11020136222. Its totient is φ = 11020136220.
The previous prime is 11020136209. The next prime is 11020136261. The reversal of 11020136221 is 12263102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6890660100 + 4129476121 = 83010^2 + 64261^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020136221 - 211 = 11020134173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020136261) 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, 5510068110 + 5510068111.
It is an arithmetic number, because the mean of its divisors is an integer number (5510068111).
Almost surely, 211020136221 is an apocalyptic number.
It is an amenable number.
11020136221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020136221 is an equidigital number, since it uses as much as digits as its factorization.
11020136221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11020136221 its reverse (12263102011), we get a palindrome (23283238232).
The spelling of 11020136221 in words is "eleven billion, twenty million, one hundred thirty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •