Base | Representation |
---|---|
bin | 10100100110000100… |
… | …00000001001001101 |
3 | 1001112120011002000222 |
4 | 22103002000021031 |
5 | 140121004211341 |
6 | 5025051401125 |
7 | 540665325524 |
oct | 122302001115 |
9 | 31476132028 |
10 | 11056710221 |
11 | 4764252047 |
12 | 2186a531a5 |
13 | 10728c20ab |
14 | 76c6334bb |
15 | 44aa4244b |
hex | 29308024d |
11056710221 has 2 divisors, whose sum is σ = 11056710222. Its totient is φ = 11056710220.
The previous prime is 11056710199. The next prime is 11056710227. The reversal of 11056710221 is 12201765011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10776516100 + 280194121 = 103810^2 + 16739^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11056710221 is a prime.
It is a super-2 number, since 2×110567102212 (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 (11056710227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528355110 + 5528355111.
It is an arithmetic number, because the mean of its divisors is an integer number (5528355111).
Almost surely, 211056710221 is an apocalyptic number.
It is an amenable number.
11056710221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056710221 is an equidigital number, since it uses as much as digits as its factorization.
11056710221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 26.
The spelling of 11056710221 in words is "eleven billion, fifty-six million, seven hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •