Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0001101000110010000101 |
3 | 1110101002020021012020101002 |
4 | 2201310200301220302011 |
5 | 2424143202333243412 |
6 | 35352320355543045 |
7 | 2225260265135264 |
oct | 241644061506205 |
9 | 43332207166332 |
10 | 11120220212357 |
11 | 35a8071451913 |
12 | 12b720b2baa85 |
13 | 62882b121699 |
14 | 2a6315c425db |
15 | 1443e0b5cdc2 |
hex | a1d20c68c85 |
11120220212357 has 2 divisors, whose sum is σ = 11120220212358. Its totient is φ = 11120220212356.
The previous prime is 11120220212327. The next prime is 11120220212419. The reversal of 11120220212357 is 75321202202111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11020069483201 + 100150729156 = 3319649^2 + 316466^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120220212357 - 230 = 11119146470533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120220212317) 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, 5560110106178 + 5560110106179.
It is an arithmetic number, because the mean of its divisors is an integer number (5560110106179).
Almost surely, 211120220212357 is an apocalyptic number.
It is an amenable number.
11120220212357 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120220212357 is an equidigital number, since it uses as much as digits as its factorization.
11120220212357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 11120220212357 its reverse (75321202202111), we get a palindrome (86441422414468).
The spelling of 11120220212357 in words is "eleven trillion, one hundred twenty billion, two hundred twenty million, two hundred twelve thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •